./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-52.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-100_file-52.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 18819524c4696c98829402bf6bc4e99abd24bef1d74fc8ec0e3ebc5e4b11aa39 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 23:44:22,582 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 23:44:22,635 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 23:44:22,638 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 23:44:22,638 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 23:44:22,660 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 23:44:22,661 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 23:44:22,661 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 23:44:22,661 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 23:44:22,662 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 23:44:22,662 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 23:44:22,662 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 23:44:22,663 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 23:44:22,663 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 23:44:22,663 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 23:44:22,663 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 23:44:22,663 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 23:44:22,663 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 23:44:22,663 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 23:44:22,664 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 23:44:22,664 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 23:44:22,664 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 23:44:22,664 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 23:44:22,664 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 23:44:22,664 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 23:44:22,664 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 23:44:22,664 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 23:44:22,664 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 23:44:22,664 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 23:44:22,664 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 23:44:22,664 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 23:44:22,664 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 23:44:22,665 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 23:44:22,665 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 23:44:22,665 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 23:44:22,665 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 23:44:22,665 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 23:44:22,665 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 23:44:22,666 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 23:44:22,666 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 23:44:22,666 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 23:44:22,666 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 23:44:22,666 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 23:44:22,666 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 -> 18819524c4696c98829402bf6bc4e99abd24bef1d74fc8ec0e3ebc5e4b11aa39 [2025-03-16 23:44:22,879 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 23:44:22,886 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 23:44:22,888 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 23:44:22,889 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 23:44:22,889 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 23:44:22,890 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-100_file-52.i [2025-03-16 23:44:23,975 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/091fd878a/bfeab1bdb4004a39a9337e6c6ce80c5a/FLAGd39ff062e [2025-03-16 23:44:24,184 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 23:44:24,185 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-52.i [2025-03-16 23:44:24,200 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/091fd878a/bfeab1bdb4004a39a9337e6c6ce80c5a/FLAGd39ff062e [2025-03-16 23:44:24,212 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/091fd878a/bfeab1bdb4004a39a9337e6c6ce80c5a [2025-03-16 23:44:24,214 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 23:44:24,215 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 23:44:24,216 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 23:44:24,216 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 23:44:24,218 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 23:44:24,219 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:44:24" (1/1) ... [2025-03-16 23:44:24,219 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d57fddb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:44:24, skipping insertion in model container [2025-03-16 23:44:24,220 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:44:24" (1/1) ... [2025-03-16 23:44:24,234 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 23:44:24,335 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-100_file-52.i[916,929] [2025-03-16 23:44:24,415 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 23:44:24,427 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 23:44:24,436 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-100_file-52.i[916,929] [2025-03-16 23:44:24,480 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 23:44:24,497 INFO L204 MainTranslator]: Completed translation [2025-03-16 23:44:24,498 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:44:24 WrapperNode [2025-03-16 23:44:24,498 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 23:44:24,499 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 23:44:24,499 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 23:44:24,499 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 23:44:24,505 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:44:24" (1/1) ... [2025-03-16 23:44:24,518 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:44:24" (1/1) ... [2025-03-16 23:44:24,552 INFO L138 Inliner]: procedures = 26, calls = 59, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 311 [2025-03-16 23:44:24,556 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 23:44:24,556 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 23:44:24,556 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 23:44:24,556 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 23:44:24,564 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:44:24" (1/1) ... [2025-03-16 23:44:24,564 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:44:24" (1/1) ... [2025-03-16 23:44:24,572 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:44:24" (1/1) ... [2025-03-16 23:44:24,595 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-16 23:44:24,595 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:44:24" (1/1) ... [2025-03-16 23:44:24,595 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:44:24" (1/1) ... [2025-03-16 23:44:24,607 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:44:24" (1/1) ... [2025-03-16 23:44:24,609 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:44:24" (1/1) ... [2025-03-16 23:44:24,610 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:44:24" (1/1) ... [2025-03-16 23:44:24,614 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:44:24" (1/1) ... [2025-03-16 23:44:24,616 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 23:44:24,618 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 23:44:24,618 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 23:44:24,618 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 23:44:24,619 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:44:24" (1/1) ... [2025-03-16 23:44:24,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 23:44:24,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:44:24,646 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-16 23:44:24,649 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-16 23:44:24,665 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 23:44:24,666 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-16 23:44:24,666 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-16 23:44:24,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 23:44:24,666 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 23:44:24,666 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 23:44:24,749 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 23:44:24,751 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 23:44:25,146 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-03-16 23:44:25,148 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 23:44:25,166 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 23:44:25,166 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 23:44:25,167 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:44:25 BoogieIcfgContainer [2025-03-16 23:44:25,167 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 23:44:25,169 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 23:44:25,169 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 23:44:25,172 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 23:44:25,173 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 11:44:24" (1/3) ... [2025-03-16 23:44:25,173 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5993ca4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:44:25, skipping insertion in model container [2025-03-16 23:44:25,173 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:44:24" (2/3) ... [2025-03-16 23:44:25,173 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5993ca4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:44:25, skipping insertion in model container [2025-03-16 23:44:25,173 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:44:25" (3/3) ... [2025-03-16 23:44:25,174 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-100_file-52.i [2025-03-16 23:44:25,185 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 23:44:25,187 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-100_file-52.i that has 2 procedures, 128 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 23:44:25,230 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 23:44:25,240 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;@76cef020, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 23:44:25,241 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 23:44:25,245 INFO L276 IsEmpty]: Start isEmpty. Operand has 128 states, 79 states have (on average 1.4936708860759493) internal successors, (118), 80 states have internal predecessors, (118), 46 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-16 23:44:25,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2025-03-16 23:44:25,258 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:44:25,259 INFO L218 NwaCegarLoop]: trace histogram [46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:44:25,260 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:44:25,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:44:25,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1951803600, now seen corresponding path program 1 times [2025-03-16 23:44:25,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:44:25,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829391470] [2025-03-16 23:44:25,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:44:25,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:44:25,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 281 statements into 1 equivalence classes. [2025-03-16 23:44:25,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 281 of 281 statements. [2025-03-16 23:44:25,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:44:25,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:44:25,553 INFO L134 CoverageAnalysis]: Checked inductivity of 4140 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 4050 trivial. 0 not checked. [2025-03-16 23:44:25,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:44:25,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829391470] [2025-03-16 23:44:25,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829391470] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 23:44:25,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [523471245] [2025-03-16 23:44:25,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:44:25,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 23:44:25,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:44:25,558 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 23:44:25,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 23:44:25,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 281 statements into 1 equivalence classes. [2025-03-16 23:44:25,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 281 of 281 statements. [2025-03-16 23:44:25,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:44:25,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:44:25,747 INFO L256 TraceCheckSpWp]: Trace formula consists of 642 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-16 23:44:25,755 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:44:25,787 INFO L134 CoverageAnalysis]: Checked inductivity of 4140 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 4050 trivial. 0 not checked. [2025-03-16 23:44:25,787 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 23:44:25,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [523471245] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:44:25,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 23:44:25,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-16 23:44:25,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965363896] [2025-03-16 23:44:25,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:44:25,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 23:44:25,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:44:25,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 23:44:25,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 23:44:25,810 INFO L87 Difference]: Start difference. First operand has 128 states, 79 states have (on average 1.4936708860759493) internal successors, (118), 80 states have internal predecessors, (118), 46 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) Second operand has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (46), 2 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 2 states have call successors, (46) [2025-03-16 23:44:25,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:44:25,842 INFO L93 Difference]: Finished difference Result 249 states and 457 transitions. [2025-03-16 23:44:25,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 23:44:25,843 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (46), 2 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 2 states have call successors, (46) Word has length 281 [2025-03-16 23:44:25,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:44:25,849 INFO L225 Difference]: With dead ends: 249 [2025-03-16 23:44:25,849 INFO L226 Difference]: Without dead ends: 122 [2025-03-16 23:44:25,852 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 23:44:25,854 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 23:44:25,854 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 194 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 23:44:25,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-03-16 23:44:25,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2025-03-16 23:44:25,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 74 states have (on average 1.4189189189189189) internal successors, (105), 74 states have internal predecessors, (105), 46 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-16 23:44:25,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 197 transitions. [2025-03-16 23:44:25,894 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 197 transitions. Word has length 281 [2025-03-16 23:44:25,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:44:25,894 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 197 transitions. [2025-03-16 23:44:25,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (46), 2 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 2 states have call successors, (46) [2025-03-16 23:44:25,895 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 197 transitions. [2025-03-16 23:44:25,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2025-03-16 23:44:25,898 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:44:25,898 INFO L218 NwaCegarLoop]: trace histogram [46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:44:25,905 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-16 23:44:26,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-16 23:44:26,099 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:44:26,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:44:26,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1718628690, now seen corresponding path program 1 times [2025-03-16 23:44:26,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:44:26,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036569699] [2025-03-16 23:44:26,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:44:26,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:44:26,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 281 statements into 1 equivalence classes. [2025-03-16 23:44:26,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 281 of 281 statements. [2025-03-16 23:44:26,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:44:26,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:44:26,518 INFO L134 CoverageAnalysis]: Checked inductivity of 4140 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2025-03-16 23:44:26,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:44:26,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036569699] [2025-03-16 23:44:26,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036569699] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:44:26,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:44:26,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 23:44:26,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545962543] [2025-03-16 23:44:26,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:44:26,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 23:44:26,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:44:26,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 23:44:26,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 23:44:26,520 INFO L87 Difference]: Start difference. First operand 122 states and 197 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) [2025-03-16 23:44:26,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:44:26,591 INFO L93 Difference]: Finished difference Result 315 states and 509 transitions. [2025-03-16 23:44:26,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 23:44:26,592 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) Word has length 281 [2025-03-16 23:44:26,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:44:26,596 INFO L225 Difference]: With dead ends: 315 [2025-03-16 23:44:26,597 INFO L226 Difference]: Without dead ends: 194 [2025-03-16 23:44:26,598 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 23:44:26,600 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 113 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 23:44:26,600 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 420 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 23:44:26,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2025-03-16 23:44:26,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 191. [2025-03-16 23:44:26,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 124 states have (on average 1.467741935483871) internal successors, (182), 125 states have internal predecessors, (182), 64 states have call successors, (64), 2 states have call predecessors, (64), 2 states have return successors, (64), 63 states have call predecessors, (64), 64 states have call successors, (64) [2025-03-16 23:44:26,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 310 transitions. [2025-03-16 23:44:26,633 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 310 transitions. Word has length 281 [2025-03-16 23:44:26,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:44:26,634 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 310 transitions. [2025-03-16 23:44:26,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) [2025-03-16 23:44:26,634 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 310 transitions. [2025-03-16 23:44:26,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2025-03-16 23:44:26,639 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:44:26,639 INFO L218 NwaCegarLoop]: trace histogram [46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:44:26,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 23:44:26,639 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:44:26,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:44:26,640 INFO L85 PathProgramCache]: Analyzing trace with hash 400069013, now seen corresponding path program 1 times [2025-03-16 23:44:26,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:44:26,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975187885] [2025-03-16 23:44:26,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:44:26,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:44:26,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 282 statements into 1 equivalence classes. [2025-03-16 23:44:26,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 282 of 282 statements. [2025-03-16 23:44:26,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:44:26,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:44:35,932 INFO L134 CoverageAnalysis]: Checked inductivity of 4140 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2025-03-16 23:44:35,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:44:35,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975187885] [2025-03-16 23:44:35,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975187885] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:44:35,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:44:35,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-16 23:44:35,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338952332] [2025-03-16 23:44:35,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:44:35,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-16 23:44:35,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:44:35,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-16 23:44:35,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2025-03-16 23:44:35,941 INFO L87 Difference]: Start difference. First operand 191 states and 310 transitions. Second operand has 15 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 15 states have internal predecessors, (55), 3 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 3 states have call predecessors, (46), 3 states have call successors, (46) [2025-03-16 23:44:39,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:44:39,549 INFO L93 Difference]: Finished difference Result 642 states and 1030 transitions. [2025-03-16 23:44:39,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-16 23:44:39,549 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 15 states have internal predecessors, (55), 3 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 3 states have call predecessors, (46), 3 states have call successors, (46) Word has length 282 [2025-03-16 23:44:39,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:44:39,553 INFO L225 Difference]: With dead ends: 642 [2025-03-16 23:44:39,554 INFO L226 Difference]: Without dead ends: 452 [2025-03-16 23:44:39,555 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=189, Invalid=567, Unknown=0, NotChecked=0, Total=756 [2025-03-16 23:44:39,555 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 335 mSDsluCounter, 1286 mSDsCounter, 0 mSdLazyCounter, 1275 mSolverCounterSat, 194 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 1458 SdHoareTripleChecker+Invalid, 1469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 194 IncrementalHoareTripleChecker+Valid, 1275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-16 23:44:39,556 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 1458 Invalid, 1469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [194 Valid, 1275 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-16 23:44:39,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2025-03-16 23:44:39,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 340. [2025-03-16 23:44:39,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 226 states have (on average 1.4690265486725664) internal successors, (332), 227 states have internal predecessors, (332), 110 states have call successors, (110), 3 states have call predecessors, (110), 3 states have return successors, (110), 109 states have call predecessors, (110), 110 states have call successors, (110) [2025-03-16 23:44:39,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 552 transitions. [2025-03-16 23:44:39,613 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 552 transitions. Word has length 282 [2025-03-16 23:44:39,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:44:39,615 INFO L471 AbstractCegarLoop]: Abstraction has 340 states and 552 transitions. [2025-03-16 23:44:39,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 15 states have internal predecessors, (55), 3 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 3 states have call predecessors, (46), 3 states have call successors, (46) [2025-03-16 23:44:39,615 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 552 transitions. [2025-03-16 23:44:39,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2025-03-16 23:44:39,617 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:44:39,617 INFO L218 NwaCegarLoop]: trace histogram [46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:44:39,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 23:44:39,618 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:44:39,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:44:39,619 INFO L85 PathProgramCache]: Analyzing trace with hash 203555508, now seen corresponding path program 1 times [2025-03-16 23:44:39,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:44:39,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800602765] [2025-03-16 23:44:39,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:44:39,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:44:39,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 282 statements into 1 equivalence classes. [2025-03-16 23:44:39,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 282 of 282 statements. [2025-03-16 23:44:39,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:44:39,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:44:39,801 INFO L134 CoverageAnalysis]: Checked inductivity of 4140 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2025-03-16 23:44:39,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:44:39,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800602765] [2025-03-16 23:44:39,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800602765] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:44:39,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:44:39,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 23:44:39,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980870589] [2025-03-16 23:44:39,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:44:39,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 23:44:39,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:44:39,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 23:44:39,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 23:44:39,804 INFO L87 Difference]: Start difference. First operand 340 states and 552 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) [2025-03-16 23:44:39,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:44:39,997 INFO L93 Difference]: Finished difference Result 740 states and 1202 transitions. [2025-03-16 23:44:39,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 23:44:39,998 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) Word has length 282 [2025-03-16 23:44:39,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:44:40,004 INFO L225 Difference]: With dead ends: 740 [2025-03-16 23:44:40,005 INFO L226 Difference]: Without dead ends: 550 [2025-03-16 23:44:40,007 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 23:44:40,007 INFO L435 NwaCegarLoop]: 364 mSDtfsCounter, 214 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 804 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 23:44:40,008 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 804 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 23:44:40,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2025-03-16 23:44:40,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 346. [2025-03-16 23:44:40,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 232 states have (on average 1.456896551724138) internal successors, (338), 233 states have internal predecessors, (338), 110 states have call successors, (110), 3 states have call predecessors, (110), 3 states have return successors, (110), 109 states have call predecessors, (110), 110 states have call successors, (110) [2025-03-16 23:44:40,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 558 transitions. [2025-03-16 23:44:40,053 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 558 transitions. Word has length 282 [2025-03-16 23:44:40,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:44:40,055 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 558 transitions. [2025-03-16 23:44:40,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) [2025-03-16 23:44:40,055 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 558 transitions. [2025-03-16 23:44:40,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2025-03-16 23:44:40,057 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:44:40,057 INFO L218 NwaCegarLoop]: trace histogram [46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:44:40,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 23:44:40,057 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:44:40,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:44:40,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1789909356, now seen corresponding path program 1 times [2025-03-16 23:44:40,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:44:40,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697865570] [2025-03-16 23:44:40,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:44:40,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:44:40,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 282 statements into 1 equivalence classes. [2025-03-16 23:44:40,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 282 of 282 statements. [2025-03-16 23:44:40,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:44:40,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:44:43,930 INFO L134 CoverageAnalysis]: Checked inductivity of 4140 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2025-03-16 23:44:43,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:44:43,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697865570] [2025-03-16 23:44:43,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697865570] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:44:43,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:44:43,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-16 23:44:43,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264523323] [2025-03-16 23:44:43,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:44:43,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-16 23:44:43,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:44:43,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-16 23:44:43,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2025-03-16 23:44:43,932 INFO L87 Difference]: Start difference. First operand 346 states and 558 transitions. Second operand has 15 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 15 states have internal predecessors, (55), 4 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 3 states have call predecessors, (46), 4 states have call successors, (46) [2025-03-16 23:44:45,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:44:45,606 INFO L93 Difference]: Finished difference Result 652 states and 1037 transitions. [2025-03-16 23:44:45,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 23:44:45,606 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 15 states have internal predecessors, (55), 4 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 3 states have call predecessors, (46), 4 states have call successors, (46) Word has length 282 [2025-03-16 23:44:45,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:44:45,609 INFO L225 Difference]: With dead ends: 652 [2025-03-16 23:44:45,609 INFO L226 Difference]: Without dead ends: 456 [2025-03-16 23:44:45,610 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=110, Invalid=352, Unknown=0, NotChecked=0, Total=462 [2025-03-16 23:44:45,612 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 512 mSDsluCounter, 991 mSDsCounter, 0 mSdLazyCounter, 995 mSolverCounterSat, 327 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 512 SdHoareTripleChecker+Valid, 1174 SdHoareTripleChecker+Invalid, 1322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 327 IncrementalHoareTripleChecker+Valid, 995 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-16 23:44:45,613 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [512 Valid, 1174 Invalid, 1322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [327 Valid, 995 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-16 23:44:45,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2025-03-16 23:44:45,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 354. [2025-03-16 23:44:45,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 240 states have (on average 1.45) internal successors, (348), 241 states have internal predecessors, (348), 110 states have call successors, (110), 3 states have call predecessors, (110), 3 states have return successors, (110), 109 states have call predecessors, (110), 110 states have call successors, (110) [2025-03-16 23:44:45,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 568 transitions. [2025-03-16 23:44:45,651 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 568 transitions. Word has length 282 [2025-03-16 23:44:45,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:44:45,654 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 568 transitions. [2025-03-16 23:44:45,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 15 states have internal predecessors, (55), 4 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 3 states have call predecessors, (46), 4 states have call successors, (46) [2025-03-16 23:44:45,654 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 568 transitions. [2025-03-16 23:44:45,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2025-03-16 23:44:45,656 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:44:45,657 INFO L218 NwaCegarLoop]: trace histogram [46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:44:45,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 23:44:45,657 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:44:45,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:44:45,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1986422861, now seen corresponding path program 1 times [2025-03-16 23:44:45,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:44:45,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939192927] [2025-03-16 23:44:45,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:44:45,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:44:45,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 282 statements into 1 equivalence classes. [2025-03-16 23:44:45,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 282 of 282 statements. [2025-03-16 23:44:45,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:44:45,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:44:45,967 INFO L134 CoverageAnalysis]: Checked inductivity of 4140 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2025-03-16 23:44:45,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:44:45,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939192927] [2025-03-16 23:44:45,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939192927] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:44:45,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:44:45,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 23:44:45,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289119936] [2025-03-16 23:44:45,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:44:45,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 23:44:45,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:44:45,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 23:44:45,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-16 23:44:45,970 INFO L87 Difference]: Start difference. First operand 354 states and 568 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) [2025-03-16 23:44:46,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:44:46,074 INFO L93 Difference]: Finished difference Result 628 states and 985 transitions. [2025-03-16 23:44:46,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 23:44:46,074 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) Word has length 282 [2025-03-16 23:44:46,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:44:46,077 INFO L225 Difference]: With dead ends: 628 [2025-03-16 23:44:46,077 INFO L226 Difference]: Without dead ends: 428 [2025-03-16 23:44:46,080 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-16 23:44:46,080 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 79 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 23:44:46,081 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 540 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 23:44:46,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2025-03-16 23:44:46,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 386. [2025-03-16 23:44:46,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 269 states have (on average 1.41635687732342) internal successors, (381), 270 states have internal predecessors, (381), 110 states have call successors, (110), 6 states have call predecessors, (110), 6 states have return successors, (110), 109 states have call predecessors, (110), 110 states have call successors, (110) [2025-03-16 23:44:46,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 601 transitions. [2025-03-16 23:44:46,119 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 601 transitions. Word has length 282 [2025-03-16 23:44:46,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:44:46,120 INFO L471 AbstractCegarLoop]: Abstraction has 386 states and 601 transitions. [2025-03-16 23:44:46,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) [2025-03-16 23:44:46,120 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 601 transitions. [2025-03-16 23:44:46,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2025-03-16 23:44:46,122 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:44:46,123 INFO L218 NwaCegarLoop]: trace histogram [46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:44:46,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 23:44:46,123 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:44:46,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:44:46,123 INFO L85 PathProgramCache]: Analyzing trace with hash 106666006, now seen corresponding path program 1 times [2025-03-16 23:44:46,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:44:46,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367254730] [2025-03-16 23:44:46,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:44:46,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:44:46,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 282 statements into 1 equivalence classes. [2025-03-16 23:44:46,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 282 of 282 statements. [2025-03-16 23:44:46,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:44:46,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:44:46,215 INFO L134 CoverageAnalysis]: Checked inductivity of 4140 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2025-03-16 23:44:46,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:44:46,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367254730] [2025-03-16 23:44:46,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367254730] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:44:46,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:44:46,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 23:44:46,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794357486] [2025-03-16 23:44:46,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:44:46,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 23:44:46,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:44:46,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 23:44:46,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 23:44:46,217 INFO L87 Difference]: Start difference. First operand 386 states and 601 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) [2025-03-16 23:44:46,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:44:46,405 INFO L93 Difference]: Finished difference Result 600 states and 934 transitions. [2025-03-16 23:44:46,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 23:44:46,406 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) Word has length 282 [2025-03-16 23:44:46,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:44:46,409 INFO L225 Difference]: With dead ends: 600 [2025-03-16 23:44:46,409 INFO L226 Difference]: Without dead ends: 380 [2025-03-16 23:44:46,410 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-16 23:44:46,410 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 166 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 23:44:46,411 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 275 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 23:44:46,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2025-03-16 23:44:46,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2025-03-16 23:44:46,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 263 states have (on average 1.3954372623574145) internal successors, (367), 264 states have internal predecessors, (367), 110 states have call successors, (110), 6 states have call predecessors, (110), 6 states have return successors, (110), 109 states have call predecessors, (110), 110 states have call successors, (110) [2025-03-16 23:44:46,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 587 transitions. [2025-03-16 23:44:46,465 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 587 transitions. Word has length 282 [2025-03-16 23:44:46,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:44:46,466 INFO L471 AbstractCegarLoop]: Abstraction has 380 states and 587 transitions. [2025-03-16 23:44:46,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) [2025-03-16 23:44:46,466 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 587 transitions. [2025-03-16 23:44:46,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2025-03-16 23:44:46,469 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:44:46,469 INFO L218 NwaCegarLoop]: trace histogram [46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:44:46,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 23:44:46,469 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:44:46,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:44:46,470 INFO L85 PathProgramCache]: Analyzing trace with hash -479930384, now seen corresponding path program 1 times [2025-03-16 23:44:46,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:44:46,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125839743] [2025-03-16 23:44:46,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:44:46,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:44:46,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 283 statements into 1 equivalence classes. [2025-03-16 23:44:46,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 283 of 283 statements. [2025-03-16 23:44:46,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:44:46,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:44:49,985 INFO L134 CoverageAnalysis]: Checked inductivity of 4140 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2025-03-16 23:44:49,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:44:49,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125839743] [2025-03-16 23:44:49,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125839743] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:44:49,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:44:49,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-16 23:44:49,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960254773] [2025-03-16 23:44:49,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:44:49,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-16 23:44:49,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:44:49,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-16 23:44:49,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2025-03-16 23:44:49,987 INFO L87 Difference]: Start difference. First operand 380 states and 587 transitions. Second operand has 15 states, 14 states have (on average 4.0) internal successors, (56), 15 states have internal predecessors, (56), 4 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 3 states have call predecessors, (46), 4 states have call successors, (46) [2025-03-16 23:44:52,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:44:52,011 INFO L93 Difference]: Finished difference Result 486 states and 721 transitions. [2025-03-16 23:44:52,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-16 23:44:52,013 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.0) internal successors, (56), 15 states have internal predecessors, (56), 4 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 3 states have call predecessors, (46), 4 states have call successors, (46) Word has length 283 [2025-03-16 23:44:52,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:44:52,016 INFO L225 Difference]: With dead ends: 486 [2025-03-16 23:44:52,016 INFO L226 Difference]: Without dead ends: 484 [2025-03-16 23:44:52,017 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=285, Invalid=905, Unknown=0, NotChecked=0, Total=1190 [2025-03-16 23:44:52,018 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 334 mSDsluCounter, 1020 mSDsCounter, 0 mSdLazyCounter, 734 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 1193 SdHoareTripleChecker+Invalid, 932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 734 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 23:44:52,018 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 1193 Invalid, 932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 734 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 23:44:52,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2025-03-16 23:44:52,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 396. [2025-03-16 23:44:52,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 279 states have (on average 1.4014336917562724) internal successors, (391), 280 states have internal predecessors, (391), 110 states have call successors, (110), 6 states have call predecessors, (110), 6 states have return successors, (110), 109 states have call predecessors, (110), 110 states have call successors, (110) [2025-03-16 23:44:52,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 611 transitions. [2025-03-16 23:44:52,048 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 611 transitions. Word has length 283 [2025-03-16 23:44:52,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:44:52,048 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 611 transitions. [2025-03-16 23:44:52,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.0) internal successors, (56), 15 states have internal predecessors, (56), 4 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 3 states have call predecessors, (46), 4 states have call successors, (46) [2025-03-16 23:44:52,049 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 611 transitions. [2025-03-16 23:44:52,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2025-03-16 23:44:52,052 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:44:52,052 INFO L218 NwaCegarLoop]: trace histogram [46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:44:52,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 23:44:52,052 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:44:52,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:44:52,053 INFO L85 PathProgramCache]: Analyzing trace with hash 608428430, now seen corresponding path program 1 times [2025-03-16 23:44:52,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:44:52,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336227595] [2025-03-16 23:44:52,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:44:52,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:44:52,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 283 statements into 1 equivalence classes. [2025-03-16 23:44:52,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 283 of 283 statements. [2025-03-16 23:44:52,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:44:52,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:44:54,606 INFO L134 CoverageAnalysis]: Checked inductivity of 4140 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2025-03-16 23:44:54,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:44:54,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336227595] [2025-03-16 23:44:54,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336227595] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:44:54,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:44:54,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-16 23:44:54,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174395314] [2025-03-16 23:44:54,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:44:54,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-16 23:44:54,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:44:54,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-16 23:44:54,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-03-16 23:44:54,608 INFO L87 Difference]: Start difference. First operand 396 states and 611 transitions. Second operand has 14 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 14 states have internal predecessors, (56), 4 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 3 states have call predecessors, (46), 4 states have call successors, (46) [2025-03-16 23:44:55,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:44:55,272 INFO L93 Difference]: Finished difference Result 652 states and 993 transitions. [2025-03-16 23:44:55,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 23:44:55,273 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 14 states have internal predecessors, (56), 4 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 3 states have call predecessors, (46), 4 states have call successors, (46) Word has length 283 [2025-03-16 23:44:55,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:44:55,276 INFO L225 Difference]: With dead ends: 652 [2025-03-16 23:44:55,276 INFO L226 Difference]: Without dead ends: 412 [2025-03-16 23:44:55,277 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2025-03-16 23:44:55,277 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 216 mSDsluCounter, 1208 mSDsCounter, 0 mSdLazyCounter, 624 mSolverCounterSat, 187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 1390 SdHoareTripleChecker+Invalid, 811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 23:44:55,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 1390 Invalid, 811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 624 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 23:44:55,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2025-03-16 23:44:55,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 380. [2025-03-16 23:44:55,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 263 states have (on average 1.3954372623574145) internal successors, (367), 264 states have internal predecessors, (367), 110 states have call successors, (110), 6 states have call predecessors, (110), 6 states have return successors, (110), 109 states have call predecessors, (110), 110 states have call successors, (110) [2025-03-16 23:44:55,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 587 transitions. [2025-03-16 23:44:55,301 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 587 transitions. Word has length 283 [2025-03-16 23:44:55,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:44:55,302 INFO L471 AbstractCegarLoop]: Abstraction has 380 states and 587 transitions. [2025-03-16 23:44:55,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 14 states have internal predecessors, (56), 4 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 3 states have call predecessors, (46), 4 states have call successors, (46) [2025-03-16 23:44:55,302 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 587 transitions. [2025-03-16 23:44:55,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2025-03-16 23:44:55,303 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:44:55,303 INFO L218 NwaCegarLoop]: trace histogram [46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:44:55,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 23:44:55,304 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:44:55,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:44:55,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1446734446, now seen corresponding path program 1 times [2025-03-16 23:44:55,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:44:55,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053107011] [2025-03-16 23:44:55,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:44:55,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:44:55,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 283 statements into 1 equivalence classes. [2025-03-16 23:44:55,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 283 of 283 statements. [2025-03-16 23:44:55,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:44:55,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:44:56,926 INFO L134 CoverageAnalysis]: Checked inductivity of 4140 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2025-03-16 23:44:56,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:44:56,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053107011] [2025-03-16 23:44:56,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053107011] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:44:56,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:44:56,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 23:44:56,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015748070] [2025-03-16 23:44:56,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:44:56,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 23:44:56,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:44:56,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 23:44:56,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-16 23:44:56,927 INFO L87 Difference]: Start difference. First operand 380 states and 587 transitions. Second operand has 10 states, 9 states have (on average 6.222222222222222) internal successors, (56), 10 states have internal predecessors, (56), 4 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 3 states have call predecessors, (46), 4 states have call successors, (46) [2025-03-16 23:44:57,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:44:57,430 INFO L93 Difference]: Finished difference Result 598 states and 922 transitions. [2025-03-16 23:44:57,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 23:44:57,430 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.222222222222222) internal successors, (56), 10 states have internal predecessors, (56), 4 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 3 states have call predecessors, (46), 4 states have call successors, (46) Word has length 283 [2025-03-16 23:44:57,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:44:57,433 INFO L225 Difference]: With dead ends: 598 [2025-03-16 23:44:57,433 INFO L226 Difference]: Without dead ends: 382 [2025-03-16 23:44:57,434 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2025-03-16 23:44:57,434 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 333 mSDsluCounter, 685 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 324 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 864 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 324 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 23:44:57,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 864 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [324 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 23:44:57,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2025-03-16 23:44:57,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 378. [2025-03-16 23:44:57,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 261 states have (on average 1.3908045977011494) internal successors, (363), 262 states have internal predecessors, (363), 110 states have call successors, (110), 6 states have call predecessors, (110), 6 states have return successors, (110), 109 states have call predecessors, (110), 110 states have call successors, (110) [2025-03-16 23:44:57,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 583 transitions. [2025-03-16 23:44:57,458 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 583 transitions. Word has length 283 [2025-03-16 23:44:57,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:44:57,458 INFO L471 AbstractCegarLoop]: Abstraction has 378 states and 583 transitions. [2025-03-16 23:44:57,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.222222222222222) internal successors, (56), 10 states have internal predecessors, (56), 4 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 3 states have call predecessors, (46), 4 states have call successors, (46) [2025-03-16 23:44:57,458 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 583 transitions. [2025-03-16 23:44:57,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 564 [2025-03-16 23:44:57,461 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:44:57,461 INFO L218 NwaCegarLoop]: trace histogram [92, 92, 92, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-16 23:44:57,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 23:44:57,462 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:44:57,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:44:57,462 INFO L85 PathProgramCache]: Analyzing trace with hash 947216836, now seen corresponding path program 1 times [2025-03-16 23:44:57,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:44:57,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666574288] [2025-03-16 23:44:57,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:44:57,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:44:57,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 563 statements into 1 equivalence classes. [2025-03-16 23:44:57,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 563 of 563 statements. [2025-03-16 23:44:57,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:44:57,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:45:03,753 INFO L134 CoverageAnalysis]: Checked inductivity of 16840 backedges. 1 proven. 95 refuted. 0 times theorem prover too weak. 16744 trivial. 0 not checked. [2025-03-16 23:45:03,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:45:03,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666574288] [2025-03-16 23:45:03,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666574288] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 23:45:03,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [634322392] [2025-03-16 23:45:03,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:45:03,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 23:45:03,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:45:03,756 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 23:45:03,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 23:45:03,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 563 statements into 1 equivalence classes. [2025-03-16 23:45:03,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 563 of 563 statements. [2025-03-16 23:45:03,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:45:03,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:45:03,963 INFO L256 TraceCheckSpWp]: Trace formula consists of 1169 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-03-16 23:45:03,978 INFO L279 TraceCheckSpWp]: Computing forward predicates...