./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-86.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-86.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 517783448a287c62461a35f1bc15cb8b62fca77248cd9526eca120bea485e50a --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 00:00:27,051 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 00:00:27,113 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 00:00:27,118 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 00:00:27,119 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 00:00:27,143 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 00:00:27,144 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 00:00:27,145 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 00:00:27,145 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 00:00:27,145 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 00:00:27,146 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 00:00:27,146 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 00:00:27,146 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 00:00:27,146 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 00:00:27,147 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 00:00:27,147 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 00:00:27,147 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 00:00:27,147 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 00:00:27,147 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 00:00:27,147 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 00:00:27,147 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 00:00:27,147 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 00:00:27,147 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 00:00:27,148 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 00:00:27,148 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 00:00:27,148 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 00:00:27,148 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 00:00:27,148 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 00:00:27,148 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 00:00:27,148 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 00:00:27,148 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 00:00:27,148 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 00:00:27,149 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 00:00:27,149 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 00:00:27,149 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 00:00:27,149 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 00:00:27,149 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 00:00:27,149 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 00:00:27,149 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 00:00:27,149 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 00:00:27,149 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 00:00:27,149 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 00:00:27,149 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 00:00:27,149 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 -> 517783448a287c62461a35f1bc15cb8b62fca77248cd9526eca120bea485e50a [2025-03-17 00:00:27,402 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 00:00:27,411 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 00:00:27,413 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 00:00:27,414 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 00:00:27,414 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 00:00:27,415 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-10_file-86.i [2025-03-17 00:00:28,580 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2382b6ed/9854503c39b14bb2896470d70b1c261d/FLAG1e6fb00f0 [2025-03-17 00:00:28,856 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 00:00:28,857 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-86.i [2025-03-17 00:00:28,901 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2382b6ed/9854503c39b14bb2896470d70b1c261d/FLAG1e6fb00f0 [2025-03-17 00:00:28,919 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2382b6ed/9854503c39b14bb2896470d70b1c261d [2025-03-17 00:00:28,922 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 00:00:28,925 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 00:00:28,927 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 00:00:28,927 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 00:00:28,931 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 00:00:28,932 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:00:28" (1/1) ... [2025-03-17 00:00:28,933 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5dccefd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:00:28, skipping insertion in model container [2025-03-17 00:00:28,933 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:00:28" (1/1) ... [2025-03-17 00:00:28,952 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 00:00:29,060 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-10_file-86.i[915,928] [2025-03-17 00:00:29,108 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 00:00:29,116 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 00:00:29,125 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-10_file-86.i[915,928] [2025-03-17 00:00:29,146 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 00:00:29,161 INFO L204 MainTranslator]: Completed translation [2025-03-17 00:00:29,161 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:00:29 WrapperNode [2025-03-17 00:00:29,162 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 00:00:29,162 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 00:00:29,162 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 00:00:29,163 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 00:00:29,167 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:00:29" (1/1) ... [2025-03-17 00:00:29,173 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:00:29" (1/1) ... [2025-03-17 00:00:29,201 INFO L138 Inliner]: procedures = 26, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 180 [2025-03-17 00:00:29,202 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 00:00:29,202 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 00:00:29,202 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 00:00:29,203 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 00:00:29,208 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:00:29" (1/1) ... [2025-03-17 00:00:29,209 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:00:29" (1/1) ... [2025-03-17 00:00:29,211 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:00:29" (1/1) ... [2025-03-17 00:00:29,226 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 00:00:29,226 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:00:29" (1/1) ... [2025-03-17 00:00:29,227 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:00:29" (1/1) ... [2025-03-17 00:00:29,233 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:00:29" (1/1) ... [2025-03-17 00:00:29,234 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:00:29" (1/1) ... [2025-03-17 00:00:29,235 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:00:29" (1/1) ... [2025-03-17 00:00:29,236 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:00:29" (1/1) ... [2025-03-17 00:00:29,238 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 00:00:29,239 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 00:00:29,239 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 00:00:29,239 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 00:00:29,240 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:00:29" (1/1) ... [2025-03-17 00:00:29,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 00:00:29,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:00:29,270 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 00:00:29,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 00:00:29,289 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 00:00:29,289 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 00:00:29,289 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 00:00:29,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 00:00:29,290 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 00:00:29,290 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 00:00:29,356 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 00:00:29,358 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 00:00:29,619 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-03-17 00:00:29,619 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 00:00:29,630 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 00:00:29,631 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 00:00:29,631 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:00:29 BoogieIcfgContainer [2025-03-17 00:00:29,631 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 00:00:29,633 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 00:00:29,633 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 00:00:29,637 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 00:00:29,637 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 12:00:28" (1/3) ... [2025-03-17 00:00:29,638 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fd6d6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:00:29, skipping insertion in model container [2025-03-17 00:00:29,639 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:00:29" (2/3) ... [2025-03-17 00:00:29,639 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fd6d6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:00:29, skipping insertion in model container [2025-03-17 00:00:29,639 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:00:29" (3/3) ... [2025-03-17 00:00:29,640 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-86.i [2025-03-17 00:00:29,654 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 00:00:29,655 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-86.i that has 2 procedures, 71 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 00:00:29,702 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 00:00:29,710 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;@5f3c2beb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 00:00:29,710 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 00:00:29,714 INFO L276 IsEmpty]: Start isEmpty. Operand has 71 states, 40 states have (on average 1.375) internal successors, (55), 41 states have internal predecessors, (55), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-17 00:00:29,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-17 00:00:29,725 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:00:29,726 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:00:29,726 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:00:29,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:00:29,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1138592248, now seen corresponding path program 1 times [2025-03-17 00:00:29,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:00:29,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634625577] [2025-03-17 00:00:29,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:00:29,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:00:29,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-17 00:00:29,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-17 00:00:29,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:00:29,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:00:30,388 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-17 00:00:30,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:00:30,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634625577] [2025-03-17 00:00:30,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634625577] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:00:30,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:00:30,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 00:00:30,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42707772] [2025-03-17 00:00:30,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:00:30,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 00:00:30,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:00:30,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 00:00:30,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 00:00:30,415 INFO L87 Difference]: Start difference. First operand has 71 states, 40 states have (on average 1.375) internal successors, (55), 41 states have internal predecessors, (55), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-17 00:00:30,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:00:30,701 INFO L93 Difference]: Finished difference Result 208 states and 387 transitions. [2025-03-17 00:00:30,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 00:00:30,706 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 171 [2025-03-17 00:00:30,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:00:30,715 INFO L225 Difference]: With dead ends: 208 [2025-03-17 00:00:30,715 INFO L226 Difference]: Without dead ends: 138 [2025-03-17 00:00:30,720 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 00:00:30,723 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 74 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 00:00:30,724 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 345 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 00:00:30,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-03-17 00:00:30,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 119. [2025-03-17 00:00:30,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 60 states have (on average 1.2166666666666666) internal successors, (73), 60 states have internal predecessors, (73), 56 states have call successors, (56), 2 states have call predecessors, (56), 2 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-17 00:00:30,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 185 transitions. [2025-03-17 00:00:30,792 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 185 transitions. Word has length 171 [2025-03-17 00:00:30,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:00:30,793 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 185 transitions. [2025-03-17 00:00:30,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-17 00:00:30,793 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 185 transitions. [2025-03-17 00:00:30,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-17 00:00:30,798 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:00:30,798 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:00:30,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 00:00:30,798 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:00:30,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:00:30,800 INFO L85 PathProgramCache]: Analyzing trace with hash 845189241, now seen corresponding path program 1 times [2025-03-17 00:00:30,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:00:30,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409560737] [2025-03-17 00:00:30,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:00:30,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:00:30,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-17 00:00:30,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-17 00:00:30,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:00:30,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:00:35,109 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-17 00:00:35,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:00:35,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409560737] [2025-03-17 00:00:35,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409560737] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:00:35,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:00:35,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-17 00:00:35,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039518827] [2025-03-17 00:00:35,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:00:35,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 00:00:35,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:00:35,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 00:00:35,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2025-03-17 00:00:35,112 INFO L87 Difference]: Start difference. First operand 119 states and 185 transitions. Second operand has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-17 00:00:35,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:00:35,950 INFO L93 Difference]: Finished difference Result 258 states and 392 transitions. [2025-03-17 00:00:35,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 00:00:35,952 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 171 [2025-03-17 00:00:35,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:00:35,955 INFO L225 Difference]: With dead ends: 258 [2025-03-17 00:00:35,957 INFO L226 Difference]: Without dead ends: 190 [2025-03-17 00:00:35,958 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=149, Invalid=403, Unknown=0, NotChecked=0, Total=552 [2025-03-17 00:00:35,960 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 216 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 00:00:35,961 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 608 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 00:00:35,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2025-03-17 00:00:35,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 135. [2025-03-17 00:00:35,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 76 states have (on average 1.25) internal successors, (95), 76 states have internal predecessors, (95), 56 states have call successors, (56), 2 states have call predecessors, (56), 2 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-17 00:00:35,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 207 transitions. [2025-03-17 00:00:35,988 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 207 transitions. Word has length 171 [2025-03-17 00:00:35,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:00:35,990 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 207 transitions. [2025-03-17 00:00:35,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-17 00:00:35,990 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 207 transitions. [2025-03-17 00:00:35,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-17 00:00:35,996 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:00:35,996 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:00:35,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 00:00:35,996 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:00:35,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:00:35,997 INFO L85 PathProgramCache]: Analyzing trace with hash 648675736, now seen corresponding path program 1 times [2025-03-17 00:00:35,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:00:35,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680960915] [2025-03-17 00:00:35,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:00:35,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:00:36,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-17 00:00:36,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-17 00:00:36,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:00:36,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:00:36,077 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-17 00:00:36,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:00:36,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680960915] [2025-03-17 00:00:36,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680960915] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:00:36,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:00:36,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:00:36,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906459710] [2025-03-17 00:00:36,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:00:36,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:00:36,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:00:36,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:00:36,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:00:36,079 INFO L87 Difference]: Start difference. First operand 135 states and 207 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-17 00:00:36,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:00:36,125 INFO L93 Difference]: Finished difference Result 270 states and 417 transitions. [2025-03-17 00:00:36,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:00:36,125 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 171 [2025-03-17 00:00:36,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:00:36,127 INFO L225 Difference]: With dead ends: 270 [2025-03-17 00:00:36,127 INFO L226 Difference]: Without dead ends: 202 [2025-03-17 00:00:36,128 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-17 00:00:36,129 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 99 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:00:36,129 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 215 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:00:36,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2025-03-17 00:00:36,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 200. [2025-03-17 00:00:36,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 112 states have (on average 1.2410714285714286) internal successors, (139), 112 states have internal predecessors, (139), 84 states have call successors, (84), 3 states have call predecessors, (84), 3 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-17 00:00:36,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 307 transitions. [2025-03-17 00:00:36,174 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 307 transitions. Word has length 171 [2025-03-17 00:00:36,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:00:36,175 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 307 transitions. [2025-03-17 00:00:36,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-17 00:00:36,175 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 307 transitions. [2025-03-17 00:00:36,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-17 00:00:36,178 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:00:36,178 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:00:36,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 00:00:36,178 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:00:36,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:00:36,179 INFO L85 PathProgramCache]: Analyzing trace with hash 433894796, now seen corresponding path program 1 times [2025-03-17 00:00:36,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:00:36,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970073273] [2025-03-17 00:00:36,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:00:36,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:00:36,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-17 00:00:36,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-17 00:00:36,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:00:36,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:00:40,815 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-17 00:00:40,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:00:40,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970073273] [2025-03-17 00:00:40,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970073273] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:00:40,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:00:40,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-17 00:00:40,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147133333] [2025-03-17 00:00:40,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:00:40,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 00:00:40,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:00:40,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 00:00:40,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2025-03-17 00:00:40,818 INFO L87 Difference]: Start difference. First operand 200 states and 307 transitions. Second operand has 15 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-17 00:00:43,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:00:43,400 INFO L93 Difference]: Finished difference Result 246 states and 361 transitions. [2025-03-17 00:00:43,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-17 00:00:43,400 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 172 [2025-03-17 00:00:43,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:00:43,402 INFO L225 Difference]: With dead ends: 246 [2025-03-17 00:00:43,402 INFO L226 Difference]: Without dead ends: 244 [2025-03-17 00:00:43,403 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=231, Invalid=639, Unknown=0, NotChecked=0, Total=870 [2025-03-17 00:00:43,407 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 220 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-17 00:00:43,407 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 586 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-17 00:00:43,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2025-03-17 00:00:43,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 201. [2025-03-17 00:00:43,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 113 states have (on average 1.238938053097345) internal successors, (140), 113 states have internal predecessors, (140), 84 states have call successors, (84), 3 states have call predecessors, (84), 3 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-17 00:00:43,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 308 transitions. [2025-03-17 00:00:43,429 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 308 transitions. Word has length 172 [2025-03-17 00:00:43,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:00:43,429 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 308 transitions. [2025-03-17 00:00:43,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-17 00:00:43,430 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 308 transitions. [2025-03-17 00:00:43,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-17 00:00:43,432 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:00:43,432 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:00:43,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 00:00:43,432 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:00:43,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:00:43,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1140409425, now seen corresponding path program 1 times [2025-03-17 00:00:43,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:00:43,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257928409] [2025-03-17 00:00:43,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:00:43,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:00:43,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-17 00:00:43,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-17 00:00:43,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:00:43,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:00:43,695 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-17 00:00:43,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:00:43,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257928409] [2025-03-17 00:00:43,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257928409] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:00:43,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:00:43,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 00:00:43,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998197711] [2025-03-17 00:00:43,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:00:43,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 00:00:43,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:00:43,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 00:00:43,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 00:00:43,697 INFO L87 Difference]: Start difference. First operand 201 states and 308 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-17 00:00:43,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:00:43,773 INFO L93 Difference]: Finished difference Result 345 states and 529 transitions. [2025-03-17 00:00:43,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 00:00:43,774 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 172 [2025-03-17 00:00:43,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:00:43,776 INFO L225 Difference]: With dead ends: 345 [2025-03-17 00:00:43,776 INFO L226 Difference]: Without dead ends: 209 [2025-03-17 00:00:43,777 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-17 00:00:43,777 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 72 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:00:43,779 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 188 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:00:43,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2025-03-17 00:00:43,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 201. [2025-03-17 00:00:43,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 113 states have (on average 1.2123893805309736) internal successors, (137), 113 states have internal predecessors, (137), 84 states have call successors, (84), 3 states have call predecessors, (84), 3 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-17 00:00:43,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 305 transitions. [2025-03-17 00:00:43,806 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 305 transitions. Word has length 172 [2025-03-17 00:00:43,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:00:43,806 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 305 transitions. [2025-03-17 00:00:43,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-17 00:00:43,807 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 305 transitions. [2025-03-17 00:00:43,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-17 00:00:43,808 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:00:43,809 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:00:43,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 00:00:43,809 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:00:43,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:00:43,810 INFO L85 PathProgramCache]: Analyzing trace with hash -1111780274, now seen corresponding path program 1 times [2025-03-17 00:00:43,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:00:43,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304383296] [2025-03-17 00:00:43,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:00:43,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:00:43,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-17 00:00:43,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-17 00:00:43,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:00:43,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:00:52,917 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-17 00:00:52,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:00:52,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304383296] [2025-03-17 00:00:52,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304383296] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:00:52,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:00:52,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-17 00:00:52,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117975468] [2025-03-17 00:00:52,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:00:52,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-17 00:00:52,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:00:52,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-17 00:00:52,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2025-03-17 00:00:52,920 INFO L87 Difference]: Start difference. First operand 201 states and 305 transitions. Second operand has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 17 states have internal predecessors, (35), 3 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 3 states have call predecessors, (28), 3 states have call successors, (28) [2025-03-17 00:00:57,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:00:57,311 INFO L93 Difference]: Finished difference Result 246 states and 356 transitions. [2025-03-17 00:00:57,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 00:00:57,312 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 17 states have internal predecessors, (35), 3 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 3 states have call predecessors, (28), 3 states have call successors, (28) Word has length 172 [2025-03-17 00:00:57,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:00:57,313 INFO L225 Difference]: With dead ends: 246 [2025-03-17 00:00:57,314 INFO L226 Difference]: Without dead ends: 244 [2025-03-17 00:00:57,314 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=170, Invalid=586, Unknown=0, NotChecked=0, Total=756 [2025-03-17 00:00:57,314 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 187 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 637 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-17 00:00:57,315 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 660 Invalid, 749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 637 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-17 00:00:57,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2025-03-17 00:00:57,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 201. [2025-03-17 00:00:57,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 113 states have (on average 1.2123893805309736) internal successors, (137), 113 states have internal predecessors, (137), 84 states have call successors, (84), 3 states have call predecessors, (84), 3 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-17 00:00:57,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 305 transitions. [2025-03-17 00:00:57,340 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 305 transitions. Word has length 172 [2025-03-17 00:00:57,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:00:57,340 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 305 transitions. [2025-03-17 00:00:57,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 17 states have internal predecessors, (35), 3 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 3 states have call predecessors, (28), 3 states have call successors, (28) [2025-03-17 00:00:57,341 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 305 transitions. [2025-03-17 00:00:57,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-17 00:00:57,342 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:00:57,342 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:00:57,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 00:00:57,342 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:00:57,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:00:57,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1471778544, now seen corresponding path program 1 times [2025-03-17 00:00:57,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:00:57,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521687419] [2025-03-17 00:00:57,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:00:57,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:00:57,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-17 00:00:57,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-17 00:00:57,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:00:57,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:01:01,721 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-17 00:01:01,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:01:01,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521687419] [2025-03-17 00:01:01,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521687419] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:01:01,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:01:01,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-17 00:01:01,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318448230] [2025-03-17 00:01:01,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:01:01,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 00:01:01,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:01:01,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 00:01:01,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2025-03-17 00:01:01,723 INFO L87 Difference]: Start difference. First operand 201 states and 305 transitions. Second operand has 14 states, 14 states have (on average 2.5) internal successors, (35), 14 states have internal predecessors, (35), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-17 00:01:06,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:01:06,259 INFO L93 Difference]: Finished difference Result 265 states and 378 transitions. [2025-03-17 00:01:06,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-17 00:01:06,260 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.5) internal successors, (35), 14 states have internal predecessors, (35), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 172 [2025-03-17 00:01:06,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:01:06,264 INFO L225 Difference]: With dead ends: 265 [2025-03-17 00:01:06,264 INFO L226 Difference]: Without dead ends: 263 [2025-03-17 00:01:06,265 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=251, Invalid=561, Unknown=0, NotChecked=0, Total=812 [2025-03-17 00:01:06,265 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 205 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-17 00:01:06,265 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 555 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-17 00:01:06,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2025-03-17 00:01:06,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 210. [2025-03-17 00:01:06,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 122 states have (on average 1.221311475409836) internal successors, (149), 122 states have internal predecessors, (149), 84 states have call successors, (84), 3 states have call predecessors, (84), 3 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-17 00:01:06,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 317 transitions. [2025-03-17 00:01:06,285 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 317 transitions. Word has length 172 [2025-03-17 00:01:06,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:01:06,285 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 317 transitions. [2025-03-17 00:01:06,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.5) internal successors, (35), 14 states have internal predecessors, (35), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-17 00:01:06,285 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 317 transitions. [2025-03-17 00:01:06,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-17 00:01:06,288 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:01:06,288 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:01:06,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 00:01:06,289 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:01:06,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:01:06,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1080378417, now seen corresponding path program 1 times [2025-03-17 00:01:06,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:01:06,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433250937] [2025-03-17 00:01:06,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:01:06,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:01:06,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-17 00:01:06,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-17 00:01:06,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:01:06,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:01:13,982 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-17 00:01:13,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:01:13,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433250937] [2025-03-17 00:01:13,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433250937] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:01:13,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:01:13,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-17 00:01:13,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973286911] [2025-03-17 00:01:13,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:01:13,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 00:01:13,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:01:13,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 00:01:13,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2025-03-17 00:01:13,984 INFO L87 Difference]: Start difference. First operand 210 states and 317 transitions. Second operand has 15 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-17 00:01:20,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:01:20,004 INFO L93 Difference]: Finished difference Result 259 states and 372 transitions. [2025-03-17 00:01:20,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-17 00:01:20,006 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 172 [2025-03-17 00:01:20,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:01:20,008 INFO L225 Difference]: With dead ends: 259 [2025-03-17 00:01:20,008 INFO L226 Difference]: Without dead ends: 257 [2025-03-17 00:01:20,008 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=262, Invalid=608, Unknown=0, NotChecked=0, Total=870 [2025-03-17 00:01:20,009 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 255 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-17 00:01:20,009 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 464 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-17 00:01:20,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2025-03-17 00:01:20,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 210. [2025-03-17 00:01:20,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 122 states have (on average 1.221311475409836) internal successors, (149), 122 states have internal predecessors, (149), 84 states have call successors, (84), 3 states have call predecessors, (84), 3 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-17 00:01:20,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 317 transitions. [2025-03-17 00:01:20,026 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 317 transitions. Word has length 172 [2025-03-17 00:01:20,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:01:20,026 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 317 transitions. [2025-03-17 00:01:20,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-17 00:01:20,026 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 317 transitions. [2025-03-17 00:01:20,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-17 00:01:20,027 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:01:20,027 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:01:20,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 00:01:20,028 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:01:20,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:01:20,028 INFO L85 PathProgramCache]: Analyzing trace with hash -102618025, now seen corresponding path program 1 times [2025-03-17 00:01:20,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:01:20,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164799346] [2025-03-17 00:01:20,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:01:20,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:01:20,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-17 00:01:20,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-17 00:01:20,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:01:20,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:01:24,232 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-17 00:01:24,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:01:24,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164799346] [2025-03-17 00:01:24,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164799346] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:01:24,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:01:24,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-17 00:01:24,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011353159] [2025-03-17 00:01:24,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:01:24,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 00:01:24,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:01:24,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 00:01:24,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2025-03-17 00:01:24,233 INFO L87 Difference]: Start difference. First operand 210 states and 317 transitions. Second operand has 16 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-17 00:01:28,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:01:28,313 INFO L93 Difference]: Finished difference Result 248 states and 359 transitions. [2025-03-17 00:01:28,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 00:01:28,314 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 173 [2025-03-17 00:01:28,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:01:28,315 INFO L225 Difference]: With dead ends: 248 [2025-03-17 00:01:28,315 INFO L226 Difference]: Without dead ends: 246 [2025-03-17 00:01:28,316 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=196, Invalid=616, Unknown=0, NotChecked=0, Total=812 [2025-03-17 00:01:28,316 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 185 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 766 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 686 SdHoareTripleChecker+Invalid, 854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:01:28,316 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 686 Invalid, 854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 766 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-17 00:01:28,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2025-03-17 00:01:28,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 207. [2025-03-17 00:01:28,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 119 states have (on average 1.218487394957983) internal successors, (145), 119 states have internal predecessors, (145), 84 states have call successors, (84), 3 states have call predecessors, (84), 3 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-17 00:01:28,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 313 transitions. [2025-03-17 00:01:28,335 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 313 transitions. Word has length 173 [2025-03-17 00:01:28,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:01:28,336 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 313 transitions. [2025-03-17 00:01:28,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-17 00:01:28,337 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 313 transitions. [2025-03-17 00:01:28,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-17 00:01:28,338 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:01:28,338 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:01:28,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 00:01:28,338 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:01:28,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:01:28,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1616643500, now seen corresponding path program 1 times [2025-03-17 00:01:28,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:01:28,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828384596] [2025-03-17 00:01:28,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:01:28,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:01:28,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-17 00:01:28,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-17 00:01:28,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:01:28,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:01:36,949 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-17 00:01:36,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:01:36,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828384596] [2025-03-17 00:01:36,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828384596] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:01:36,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:01:36,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-17 00:01:36,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553921416] [2025-03-17 00:01:36,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:01:36,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 00:01:36,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:01:36,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 00:01:36,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2025-03-17 00:01:36,951 INFO L87 Difference]: Start difference. First operand 207 states and 313 transitions. Second operand has 16 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-17 00:01:44,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:01:44,312 INFO L93 Difference]: Finished difference Result 260 states and 373 transitions. [2025-03-17 00:01:44,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-17 00:01:44,313 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 173 [2025-03-17 00:01:44,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:01:44,314 INFO L225 Difference]: With dead ends: 260 [2025-03-17 00:01:44,314 INFO L226 Difference]: Without dead ends: 258 [2025-03-17 00:01:44,315 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=295, Invalid=761, Unknown=0, NotChecked=0, Total=1056 [2025-03-17 00:01:44,315 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 202 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-17 00:01:44,315 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 588 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-17 00:01:44,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2025-03-17 00:01:44,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 212. [2025-03-17 00:01:44,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 124 states have (on average 1.2258064516129032) internal successors, (152), 124 states have internal predecessors, (152), 84 states have call successors, (84), 3 states have call predecessors, (84), 3 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-17 00:01:44,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 320 transitions. [2025-03-17 00:01:44,329 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 320 transitions. Word has length 173 [2025-03-17 00:01:44,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:01:44,330 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 320 transitions. [2025-03-17 00:01:44,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-17 00:01:44,330 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 320 transitions. [2025-03-17 00:01:44,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-17 00:01:44,331 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:01:44,331 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:01:44,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 00:01:44,331 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:01:44,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:01:44,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1132618935, now seen corresponding path program 1 times [2025-03-17 00:01:44,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:01:44,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827919967] [2025-03-17 00:01:44,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:01:44,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:01:44,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-17 00:01:44,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-17 00:01:44,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:01:44,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:01:50,054 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-17 00:01:50,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:01:50,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827919967] [2025-03-17 00:01:50,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827919967] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:01:50,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:01:50,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-17 00:01:50,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934452338] [2025-03-17 00:01:50,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:01:50,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 00:01:50,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:01:50,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 00:01:50,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2025-03-17 00:01:50,056 INFO L87 Difference]: Start difference. First operand 212 states and 320 transitions. Second operand has 16 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-17 00:01:55,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:01:55,295 INFO L93 Difference]: Finished difference Result 260 states and 373 transitions. [2025-03-17 00:01:55,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-17 00:01:55,296 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 173 [2025-03-17 00:01:55,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:01:55,299 INFO L225 Difference]: With dead ends: 260 [2025-03-17 00:01:55,299 INFO L226 Difference]: Without dead ends: 258 [2025-03-17 00:01:55,300 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=280, Invalid=776, Unknown=0, NotChecked=0, Total=1056 [2025-03-17 00:01:55,301 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 194 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 616 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:01:55,301 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 655 Invalid, 701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 616 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-17 00:01:55,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2025-03-17 00:01:55,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 213. [2025-03-17 00:01:55,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 125 states have (on average 1.224) internal successors, (153), 125 states have internal predecessors, (153), 84 states have call successors, (84), 3 states have call predecessors, (84), 3 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-17 00:01:55,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 321 transitions. [2025-03-17 00:01:55,316 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 321 transitions. Word has length 173 [2025-03-17 00:01:55,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:01:55,317 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 321 transitions. [2025-03-17 00:01:55,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-17 00:01:55,317 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 321 transitions. [2025-03-17 00:01:55,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-17 00:01:55,320 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:01:55,320 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:01:55,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 00:01:55,320 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:01:55,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:01:55,321 INFO L85 PathProgramCache]: Analyzing trace with hash 870869333, now seen corresponding path program 1 times [2025-03-17 00:01:55,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:01:55,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928346092] [2025-03-17 00:01:55,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:01:55,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:01:55,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-17 00:01:55,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-17 00:01:55,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:01:55,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:01:58,334 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-17 00:01:58,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:01:58,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928346092] [2025-03-17 00:01:58,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928346092] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:01:58,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:01:58,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-17 00:01:58,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211512306] [2025-03-17 00:01:58,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:01:58,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 00:01:58,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:01:58,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 00:01:58,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2025-03-17 00:01:58,339 INFO L87 Difference]: Start difference. First operand 213 states and 321 transitions. Second operand has 16 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28)