./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-47.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-250_file-47.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 cd3632043214757caefbf8e806ad884979d5d0588e1edb63db72323f63ea6c69 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 00:06:23,827 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 00:06:23,886 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 00:06:23,895 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 00:06:23,895 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 00:06:23,917 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 00:06:23,919 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 00:06:23,919 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 00:06:23,919 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 00:06:23,920 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 00:06:23,920 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 00:06:23,920 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 00:06:23,921 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 00:06:23,921 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 00:06:23,921 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 00:06:23,921 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 00:06:23,921 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 00:06:23,921 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 00:06:23,921 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 00:06:23,921 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 00:06:23,921 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 00:06:23,921 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 00:06:23,922 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 00:06:23,922 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 00:06:23,922 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 00:06:23,922 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 00:06:23,922 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 00:06:23,922 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 00:06:23,922 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 00:06:23,922 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 00:06:23,922 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 00:06:23,923 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 00:06:23,923 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 00:06:23,923 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 00:06:23,923 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 00:06:23,924 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 00:06:23,924 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 00:06:23,924 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 00:06:23,924 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 00:06:23,924 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 00:06:23,924 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 00:06:23,924 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 00:06:23,924 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 00:06:23,924 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 -> cd3632043214757caefbf8e806ad884979d5d0588e1edb63db72323f63ea6c69 [2025-03-17 00:06:24,173 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 00:06:24,182 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 00:06:24,185 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 00:06:24,186 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 00:06:24,186 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 00:06:24,188 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-250_file-47.i [2025-03-17 00:06:25,440 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30b6fed1b/2e51c509fa0848f4b4e12601c198ddb0/FLAGb7fe95c66 [2025-03-17 00:06:25,698 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 00:06:25,700 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-47.i [2025-03-17 00:06:25,713 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30b6fed1b/2e51c509fa0848f4b4e12601c198ddb0/FLAGb7fe95c66 [2025-03-17 00:06:26,000 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30b6fed1b/2e51c509fa0848f4b4e12601c198ddb0 [2025-03-17 00:06:26,004 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 00:06:26,005 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 00:06:26,006 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 00:06:26,006 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 00:06:26,010 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 00:06:26,011 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:06:26" (1/1) ... [2025-03-17 00:06:26,012 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30780e8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:06:26, skipping insertion in model container [2025-03-17 00:06:26,013 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:06:26" (1/1) ... [2025-03-17 00:06:26,041 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 00:06:26,150 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-250_file-47.i[916,929] [2025-03-17 00:06:26,254 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 00:06:26,266 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 00:06:26,273 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-250_file-47.i[916,929] [2025-03-17 00:06:26,325 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 00:06:26,344 INFO L204 MainTranslator]: Completed translation [2025-03-17 00:06:26,345 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:06:26 WrapperNode [2025-03-17 00:06:26,345 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 00:06:26,346 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 00:06:26,347 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 00:06:26,347 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 00:06:26,352 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:06:26" (1/1) ... [2025-03-17 00:06:26,370 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:06:26" (1/1) ... [2025-03-17 00:06:26,420 INFO L138 Inliner]: procedures = 26, calls = 79, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 532 [2025-03-17 00:06:26,422 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 00:06:26,423 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 00:06:26,423 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 00:06:26,423 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 00:06:26,430 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:06:26" (1/1) ... [2025-03-17 00:06:26,430 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:06:26" (1/1) ... [2025-03-17 00:06:26,441 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:06:26" (1/1) ... [2025-03-17 00:06:26,474 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 00:06:26,474 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:06:26" (1/1) ... [2025-03-17 00:06:26,475 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:06:26" (1/1) ... [2025-03-17 00:06:26,491 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:06:26" (1/1) ... [2025-03-17 00:06:26,498 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:06:26" (1/1) ... [2025-03-17 00:06:26,507 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:06:26" (1/1) ... [2025-03-17 00:06:26,512 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:06:26" (1/1) ... [2025-03-17 00:06:26,523 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 00:06:26,525 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 00:06:26,525 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 00:06:26,525 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 00:06:26,526 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:06:26" (1/1) ... [2025-03-17 00:06:26,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 00:06:26,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:06:26,555 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 00:06:26,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 00:06:26,575 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 00:06:26,575 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 00:06:26,575 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 00:06:26,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 00:06:26,576 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 00:06:26,576 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 00:06:26,687 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 00:06:26,690 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 00:06:27,339 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L440: havoc property_#t~bitwise48#1;havoc property_#t~ite50#1;havoc property_#t~bitwise49#1;havoc property_#t~short51#1; [2025-03-17 00:06:27,430 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-03-17 00:06:27,431 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 00:06:27,459 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 00:06:27,460 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 00:06:27,461 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:06:27 BoogieIcfgContainer [2025-03-17 00:06:27,461 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 00:06:27,463 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 00:06:27,463 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 00:06:27,467 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 00:06:27,467 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 12:06:26" (1/3) ... [2025-03-17 00:06:27,468 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67b9af5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:06:27, skipping insertion in model container [2025-03-17 00:06:27,468 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:06:26" (2/3) ... [2025-03-17 00:06:27,469 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67b9af5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:06:27, skipping insertion in model container [2025-03-17 00:06:27,469 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:06:27" (3/3) ... [2025-03-17 00:06:27,470 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-47.i [2025-03-17 00:06:27,482 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 00:06:27,484 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-47.i that has 2 procedures, 222 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 00:06:27,540 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 00:06:27,550 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;@bb32414, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 00:06:27,551 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 00:06:27,557 INFO L276 IsEmpty]: Start isEmpty. Operand has 222 states, 153 states have (on average 1.5620915032679739) internal successors, (239), 154 states have internal predecessors, (239), 66 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-17 00:06:27,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 426 [2025-03-17 00:06:27,615 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:06:27,616 INFO L218 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:06:27,617 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:06:27,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:06:27,622 INFO L85 PathProgramCache]: Analyzing trace with hash -869357990, now seen corresponding path program 1 times [2025-03-17 00:06:27,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:06:27,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281940232] [2025-03-17 00:06:27,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:06:27,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:06:27,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 425 statements into 1 equivalence classes. [2025-03-17 00:06:27,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 425 of 425 statements. [2025-03-17 00:06:27,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:06:27,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:06:28,064 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 130 refuted. 0 times theorem prover too weak. 8450 trivial. 0 not checked. [2025-03-17 00:06:28,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:06:28,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281940232] [2025-03-17 00:06:28,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281940232] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 00:06:28,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [801558175] [2025-03-17 00:06:28,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:06:28,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:06:28,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:06:28,069 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 00:06:28,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 00:06:28,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 425 statements into 1 equivalence classes. [2025-03-17 00:06:28,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 425 of 425 statements. [2025-03-17 00:06:28,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:06:28,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:06:28,319 INFO L256 TraceCheckSpWp]: Trace formula consists of 975 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 00:06:28,330 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:06:28,369 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 8450 trivial. 0 not checked. [2025-03-17 00:06:28,369 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 00:06:28,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [801558175] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:06:28,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 00:06:28,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 00:06:28,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069237891] [2025-03-17 00:06:28,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:06:28,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 00:06:28,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:06:28,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 00:06:28,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 00:06:28,393 INFO L87 Difference]: Start difference. First operand has 222 states, 153 states have (on average 1.5620915032679739) internal successors, (239), 154 states have internal predecessors, (239), 66 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) Second operand has 2 states, 2 states have (on average 50.0) internal successors, (100), 2 states have internal predecessors, (100), 2 states have call successors, (66), 2 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 2 states have call successors, (66) [2025-03-17 00:06:28,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:06:28,457 INFO L93 Difference]: Finished difference Result 441 states and 806 transitions. [2025-03-17 00:06:28,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 00:06:28,459 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 50.0) internal successors, (100), 2 states have internal predecessors, (100), 2 states have call successors, (66), 2 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 2 states have call successors, (66) Word has length 425 [2025-03-17 00:06:28,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:06:28,465 INFO L225 Difference]: With dead ends: 441 [2025-03-17 00:06:28,465 INFO L226 Difference]: Without dead ends: 220 [2025-03-17 00:06:28,468 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 426 GetRequests, 426 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 00:06:28,470 INFO L435 NwaCegarLoop]: 355 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:06:28,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 355 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:06:28,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2025-03-17 00:06:28,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2025-03-17 00:06:28,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 152 states have (on average 1.519736842105263) internal successors, (231), 152 states have internal predecessors, (231), 66 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-17 00:06:28,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 363 transitions. [2025-03-17 00:06:28,528 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 363 transitions. Word has length 425 [2025-03-17 00:06:28,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:06:28,528 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 363 transitions. [2025-03-17 00:06:28,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 50.0) internal successors, (100), 2 states have internal predecessors, (100), 2 states have call successors, (66), 2 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 2 states have call successors, (66) [2025-03-17 00:06:28,529 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 363 transitions. [2025-03-17 00:06:28,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 427 [2025-03-17 00:06:28,540 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:06:28,540 INFO L218 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:06:28,549 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 00:06:28,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 00:06:28,741 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:06:28,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:06:28,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1379857602, now seen corresponding path program 1 times [2025-03-17 00:06:28,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:06:28,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530548368] [2025-03-17 00:06:28,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:06:28,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:06:28,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 426 statements into 1 equivalence classes. [2025-03-17 00:06:28,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 426 of 426 statements. [2025-03-17 00:06:28,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:06:28,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:06:29,160 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked. [2025-03-17 00:06:29,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:06:29,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530548368] [2025-03-17 00:06:29,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530548368] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:06:29,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:06:29,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:06:29,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594403099] [2025-03-17 00:06:29,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:06:29,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:06:29,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:06:29,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:06:29,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:06:29,166 INFO L87 Difference]: Start difference. First operand 220 states and 363 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-03-17 00:06:29,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:06:29,277 INFO L93 Difference]: Finished difference Result 591 states and 974 transitions. [2025-03-17 00:06:29,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:06:29,279 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) Word has length 426 [2025-03-17 00:06:29,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:06:29,286 INFO L225 Difference]: With dead ends: 591 [2025-03-17 00:06:29,286 INFO L226 Difference]: Without dead ends: 372 [2025-03-17 00:06:29,287 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:06:29,287 INFO L435 NwaCegarLoop]: 553 mSDtfsCounter, 238 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 881 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 00:06:29,288 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 881 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 00:06:29,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2025-03-17 00:06:29,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 369. [2025-03-17 00:06:29,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 273 states have (on average 1.531135531135531) internal successors, (418), 274 states have internal predecessors, (418), 93 states have call successors, (93), 2 states have call predecessors, (93), 2 states have return successors, (93), 92 states have call predecessors, (93), 93 states have call successors, (93) [2025-03-17 00:06:29,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 604 transitions. [2025-03-17 00:06:29,338 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 604 transitions. Word has length 426 [2025-03-17 00:06:29,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:06:29,340 INFO L471 AbstractCegarLoop]: Abstraction has 369 states and 604 transitions. [2025-03-17 00:06:29,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-03-17 00:06:29,340 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 604 transitions. [2025-03-17 00:06:29,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 428 [2025-03-17 00:06:29,347 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:06:29,347 INFO L218 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:06:29,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 00:06:29,348 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:06:29,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:06:29,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1935713226, now seen corresponding path program 1 times [2025-03-17 00:06:29,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:06:29,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575963490] [2025-03-17 00:06:29,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:06:29,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:06:29,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 427 statements into 1 equivalence classes. [2025-03-17 00:06:29,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 427 of 427 statements. [2025-03-17 00:06:29,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:06:29,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:06:30,024 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked. [2025-03-17 00:06:30,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:06:30,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575963490] [2025-03-17 00:06:30,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575963490] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:06:30,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:06:30,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:06:30,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458410174] [2025-03-17 00:06:30,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:06:30,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:06:30,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:06:30,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:06:30,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:06:30,029 INFO L87 Difference]: Start difference. First operand 369 states and 604 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-03-17 00:06:30,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:06:30,134 INFO L93 Difference]: Finished difference Result 1105 states and 1810 transitions. [2025-03-17 00:06:30,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:06:30,135 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) Word has length 427 [2025-03-17 00:06:30,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:06:30,144 INFO L225 Difference]: With dead ends: 1105 [2025-03-17 00:06:30,146 INFO L226 Difference]: Without dead ends: 737 [2025-03-17 00:06:30,147 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:06:30,149 INFO L435 NwaCegarLoop]: 443 mSDtfsCounter, 230 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 791 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:06:30,150 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 791 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:06:30,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2025-03-17 00:06:30,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 735. [2025-03-17 00:06:30,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 735 states, 544 states have (on average 1.5294117647058822) internal successors, (832), 546 states have internal predecessors, (832), 186 states have call successors, (186), 4 states have call predecessors, (186), 4 states have return successors, (186), 184 states have call predecessors, (186), 186 states have call successors, (186) [2025-03-17 00:06:30,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 735 states to 735 states and 1204 transitions. [2025-03-17 00:06:30,243 INFO L78 Accepts]: Start accepts. Automaton has 735 states and 1204 transitions. Word has length 427 [2025-03-17 00:06:30,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:06:30,244 INFO L471 AbstractCegarLoop]: Abstraction has 735 states and 1204 transitions. [2025-03-17 00:06:30,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-03-17 00:06:30,245 INFO L276 IsEmpty]: Start isEmpty. Operand 735 states and 1204 transitions. [2025-03-17 00:06:30,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 429 [2025-03-17 00:06:30,249 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:06:30,249 INFO L218 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:06:30,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 00:06:30,249 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:06:30,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:06:30,250 INFO L85 PathProgramCache]: Analyzing trace with hash -2074281250, now seen corresponding path program 1 times [2025-03-17 00:06:30,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:06:30,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480616889] [2025-03-17 00:06:30,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:06:30,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:06:30,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 428 statements into 1 equivalence classes. [2025-03-17 00:06:30,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 428 of 428 statements. [2025-03-17 00:06:30,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:06:30,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:06:30,997 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked. [2025-03-17 00:06:30,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:06:30,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480616889] [2025-03-17 00:06:30,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480616889] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:06:30,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:06:30,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 00:06:30,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654728694] [2025-03-17 00:06:30,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:06:31,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 00:06:31,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:06:31,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 00:06:31,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 00:06:31,002 INFO L87 Difference]: Start difference. First operand 735 states and 1204 transitions. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-03-17 00:06:31,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:06:31,702 INFO L93 Difference]: Finished difference Result 2761 states and 4496 transitions. [2025-03-17 00:06:31,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 00:06:31,703 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) Word has length 428 [2025-03-17 00:06:31,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:06:31,714 INFO L225 Difference]: With dead ends: 2761 [2025-03-17 00:06:31,714 INFO L226 Difference]: Without dead ends: 2027 [2025-03-17 00:06:31,717 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-17 00:06:31,717 INFO L435 NwaCegarLoop]: 389 mSDtfsCounter, 817 mSDsluCounter, 945 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 469 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 817 SdHoareTripleChecker+Valid, 1334 SdHoareTripleChecker+Invalid, 677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 469 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 00:06:31,718 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [817 Valid, 1334 Invalid, 677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [469 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 00:06:31,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2027 states. [2025-03-17 00:06:31,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2027 to 1515. [2025-03-17 00:06:31,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1515 states, 1134 states have (on average 1.5185185185185186) internal successors, (1722), 1138 states have internal predecessors, (1722), 372 states have call successors, (372), 8 states have call predecessors, (372), 8 states have return successors, (372), 368 states have call predecessors, (372), 372 states have call successors, (372) [2025-03-17 00:06:31,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1515 states to 1515 states and 2466 transitions. [2025-03-17 00:06:31,898 INFO L78 Accepts]: Start accepts. Automaton has 1515 states and 2466 transitions. Word has length 428 [2025-03-17 00:06:31,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:06:31,898 INFO L471 AbstractCegarLoop]: Abstraction has 1515 states and 2466 transitions. [2025-03-17 00:06:31,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-03-17 00:06:31,899 INFO L276 IsEmpty]: Start isEmpty. Operand 1515 states and 2466 transitions. [2025-03-17 00:06:31,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 429 [2025-03-17 00:06:31,907 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:06:31,907 INFO L218 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:06:31,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 00:06:31,907 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:06:31,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:06:31,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1376214175, now seen corresponding path program 1 times [2025-03-17 00:06:31,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:06:31,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785710260] [2025-03-17 00:06:31,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:06:31,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:06:31,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 428 statements into 1 equivalence classes. [2025-03-17 00:06:32,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 428 of 428 statements. [2025-03-17 00:06:32,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:06:32,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:06:32,628 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked. [2025-03-17 00:06:32,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:06:32,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785710260] [2025-03-17 00:06:32,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785710260] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:06:32,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:06:32,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 00:06:32,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817860179] [2025-03-17 00:06:32,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:06:32,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 00:06:32,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:06:32,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 00:06:32,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 00:06:32,630 INFO L87 Difference]: Start difference. First operand 1515 states and 2466 transitions. Second operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-03-17 00:06:33,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:06:33,043 INFO L93 Difference]: Finished difference Result 2648 states and 4308 transitions. [2025-03-17 00:06:33,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 00:06:33,044 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) Word has length 428 [2025-03-17 00:06:33,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:06:33,050 INFO L225 Difference]: With dead ends: 2648 [2025-03-17 00:06:33,050 INFO L226 Difference]: Without dead ends: 1134 [2025-03-17 00:06:33,053 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 00:06:33,053 INFO L435 NwaCegarLoop]: 352 mSDtfsCounter, 318 mSDsluCounter, 681 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 199 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 1033 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 199 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 00:06:33,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 1033 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [199 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 00:06:33,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1134 states. [2025-03-17 00:06:33,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1134 to 1045. [2025-03-17 00:06:33,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1045 states, 787 states have (on average 1.5362134688691234) internal successors, (1209), 789 states have internal predecessors, (1209), 252 states have call successors, (252), 5 states have call predecessors, (252), 5 states have return successors, (252), 250 states have call predecessors, (252), 252 states have call successors, (252) [2025-03-17 00:06:33,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1045 states to 1045 states and 1713 transitions. [2025-03-17 00:06:33,125 INFO L78 Accepts]: Start accepts. Automaton has 1045 states and 1713 transitions. Word has length 428 [2025-03-17 00:06:33,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:06:33,125 INFO L471 AbstractCegarLoop]: Abstraction has 1045 states and 1713 transitions. [2025-03-17 00:06:33,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-03-17 00:06:33,126 INFO L276 IsEmpty]: Start isEmpty. Operand 1045 states and 1713 transitions. [2025-03-17 00:06:33,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2025-03-17 00:06:33,130 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:06:33,130 INFO L218 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:06:33,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 00:06:33,130 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:06:33,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:06:33,131 INFO L85 PathProgramCache]: Analyzing trace with hash -2096945123, now seen corresponding path program 1 times [2025-03-17 00:06:33,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:06:33,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628466244] [2025-03-17 00:06:33,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:06:33,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:06:33,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 430 statements into 1 equivalence classes. [2025-03-17 00:06:33,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 430 of 430 statements. [2025-03-17 00:06:33,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:06:33,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:06:33,622 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked. [2025-03-17 00:06:33,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:06:33,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628466244] [2025-03-17 00:06:33,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628466244] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:06:33,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:06:33,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 00:06:33,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115579498] [2025-03-17 00:06:33,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:06:33,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 00:06:33,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:06:33,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 00:06:33,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 00:06:33,624 INFO L87 Difference]: Start difference. First operand 1045 states and 1713 transitions. Second operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-03-17 00:06:34,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:06:34,517 INFO L93 Difference]: Finished difference Result 3292 states and 5382 transitions. [2025-03-17 00:06:34,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 00:06:34,518 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) Word has length 430 [2025-03-17 00:06:34,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:06:34,532 INFO L225 Difference]: With dead ends: 3292 [2025-03-17 00:06:34,533 INFO L226 Difference]: Without dead ends: 2558 [2025-03-17 00:06:34,536 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-17 00:06:34,537 INFO L435 NwaCegarLoop]: 698 mSDtfsCounter, 439 mSDsluCounter, 941 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 439 SdHoareTripleChecker+Valid, 1639 SdHoareTripleChecker+Invalid, 729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 00:06:34,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [439 Valid, 1639 Invalid, 729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 590 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 00:06:34,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2558 states. [2025-03-17 00:06:34,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2558 to 1930. [2025-03-17 00:06:34,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1930 states, 1482 states have (on average 1.5134952766531713) internal successors, (2243), 1486 states have internal predecessors, (2243), 438 states have call successors, (438), 9 states have call predecessors, (438), 9 states have return successors, (438), 434 states have call predecessors, (438), 438 states have call successors, (438) [2025-03-17 00:06:34,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1930 states to 1930 states and 3119 transitions. [2025-03-17 00:06:34,732 INFO L78 Accepts]: Start accepts. Automaton has 1930 states and 3119 transitions. Word has length 430 [2025-03-17 00:06:34,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:06:34,734 INFO L471 AbstractCegarLoop]: Abstraction has 1930 states and 3119 transitions. [2025-03-17 00:06:34,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-03-17 00:06:34,735 INFO L276 IsEmpty]: Start isEmpty. Operand 1930 states and 3119 transitions. [2025-03-17 00:06:34,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 432 [2025-03-17 00:06:34,739 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:06:34,739 INFO L218 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:06:34,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 00:06:34,740 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:06:34,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:06:34,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1364805216, now seen corresponding path program 1 times [2025-03-17 00:06:34,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:06:34,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441682490] [2025-03-17 00:06:34,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:06:34,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:06:34,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 431 statements into 1 equivalence classes. [2025-03-17 00:06:34,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 431 of 431 statements. [2025-03-17 00:06:34,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:06:34,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:06:35,547 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked. [2025-03-17 00:06:35,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:06:35,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441682490] [2025-03-17 00:06:35,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441682490] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:06:35,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:06:35,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 00:06:35,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982217101] [2025-03-17 00:06:35,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:06:35,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 00:06:35,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:06:35,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 00:06:35,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 00:06:35,549 INFO L87 Difference]: Start difference. First operand 1930 states and 3119 transitions. Second operand has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 7 states have internal predecessors, (104), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-03-17 00:06:36,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:06:36,255 INFO L93 Difference]: Finished difference Result 6819 states and 10953 transitions. [2025-03-17 00:06:36,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 00:06:36,256 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 7 states have internal predecessors, (104), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) Word has length 431 [2025-03-17 00:06:36,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:06:36,281 INFO L225 Difference]: With dead ends: 6819 [2025-03-17 00:06:36,282 INFO L226 Difference]: Without dead ends: 5140 [2025-03-17 00:06:36,289 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-17 00:06:36,290 INFO L435 NwaCegarLoop]: 595 mSDtfsCounter, 957 mSDsluCounter, 1209 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 352 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 957 SdHoareTripleChecker+Valid, 1804 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 352 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 00:06:36,290 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [957 Valid, 1804 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [352 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 00:06:36,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5140 states. [2025-03-17 00:06:36,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5140 to 5128. [2025-03-17 00:06:36,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5128 states, 4008 states have (on average 1.5104790419161678) internal successors, (6054), 4024 states have internal predecessors, (6054), 1094 states have call successors, (1094), 25 states have call predecessors, (1094), 25 states have return successors, (1094), 1078 states have call predecessors, (1094), 1094 states have call successors, (1094) [2025-03-17 00:06:36,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5128 states to 5128 states and 8242 transitions. [2025-03-17 00:06:36,649 INFO L78 Accepts]: Start accepts. Automaton has 5128 states and 8242 transitions. Word has length 431 [2025-03-17 00:06:36,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:06:36,650 INFO L471 AbstractCegarLoop]: Abstraction has 5128 states and 8242 transitions. [2025-03-17 00:06:36,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 7 states have internal predecessors, (104), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-03-17 00:06:36,651 INFO L276 IsEmpty]: Start isEmpty. Operand 5128 states and 8242 transitions. [2025-03-17 00:06:36,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 433 [2025-03-17 00:06:36,656 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:06:36,656 INFO L218 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:06:36,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 00:06:36,657 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:06:36,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:06:36,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1374107004, now seen corresponding path program 1 times [2025-03-17 00:06:36,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:06:36,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131636350] [2025-03-17 00:06:36,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:06:36,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:06:36,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 432 statements into 1 equivalence classes. [2025-03-17 00:06:36,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 432 of 432 statements. [2025-03-17 00:06:36,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:06:36,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:06:39,359 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked. [2025-03-17 00:06:39,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:06:39,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131636350] [2025-03-17 00:06:39,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131636350] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:06:39,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:06:39,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 00:06:39,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928786352] [2025-03-17 00:06:39,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:06:39,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 00:06:39,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:06:39,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 00:06:39,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 00:06:39,361 INFO L87 Difference]: Start difference. First operand 5128 states and 8242 transitions. Second operand has 7 states, 7 states have (on average 15.0) internal successors, (105), 7 states have internal predecessors, (105), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-03-17 00:06:41,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:06:41,542 INFO L93 Difference]: Finished difference Result 10792 states and 17188 transitions. [2025-03-17 00:06:41,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 00:06:41,543 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.0) internal successors, (105), 7 states have internal predecessors, (105), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) Word has length 432 [2025-03-17 00:06:41,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:06:41,589 INFO L225 Difference]: With dead ends: 10792 [2025-03-17 00:06:41,589 INFO L226 Difference]: Without dead ends: 8445 [2025-03-17 00:06:41,600 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-03-17 00:06:41,600 INFO L435 NwaCegarLoop]: 713 mSDtfsCounter, 1636 mSDsluCounter, 2618 mSDsCounter, 0 mSdLazyCounter, 801 mSolverCounterSat, 508 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1636 SdHoareTripleChecker+Valid, 3331 SdHoareTripleChecker+Invalid, 1309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 508 IncrementalHoareTripleChecker+Valid, 801 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-17 00:06:41,600 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1636 Valid, 3331 Invalid, 1309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [508 Valid, 801 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-17 00:06:41,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8445 states. [2025-03-17 00:06:42,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8445 to 7238. [2025-03-17 00:06:42,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7238 states, 5533 states have (on average 1.4888848725826858) internal successors, (8238), 5561 states have internal predecessors, (8238), 1646 states have call successors, (1646), 58 states have call predecessors, (1646), 58 states have return successors, (1646), 1618 states have call predecessors, (1646), 1646 states have call successors, (1646) [2025-03-17 00:06:42,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7238 states to 7238 states and 11530 transitions. [2025-03-17 00:06:42,176 INFO L78 Accepts]: Start accepts. Automaton has 7238 states and 11530 transitions. Word has length 432 [2025-03-17 00:06:42,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:06:42,177 INFO L471 AbstractCegarLoop]: Abstraction has 7238 states and 11530 transitions. [2025-03-17 00:06:42,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.0) internal successors, (105), 7 states have internal predecessors, (105), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-03-17 00:06:42,178 INFO L276 IsEmpty]: Start isEmpty. Operand 7238 states and 11530 transitions. [2025-03-17 00:06:42,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 433 [2025-03-17 00:06:42,181 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:06:42,181 INFO L218 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:06:42,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 00:06:42,182 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:06:42,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:06:42,183 INFO L85 PathProgramCache]: Analyzing trace with hash -2047139043, now seen corresponding path program 1 times [2025-03-17 00:06:42,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:06:42,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657472694] [2025-03-17 00:06:42,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:06:42,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:06:42,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 432 statements into 1 equivalence classes. [2025-03-17 00:06:42,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 432 of 432 statements. [2025-03-17 00:06:42,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:06:42,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:06:42,381 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked. [2025-03-17 00:06:42,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:06:42,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657472694] [2025-03-17 00:06:42,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657472694] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:06:42,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:06:42,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:06:42,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691983389] [2025-03-17 00:06:42,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:06:42,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:06:42,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:06:42,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:06:42,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:06:42,383 INFO L87 Difference]: Start difference. First operand 7238 states and 11530 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-03-17 00:06:43,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:06:43,112 INFO L93 Difference]: Finished difference Result 21014 states and 33436 transitions. [2025-03-17 00:06:43,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:06:43,112 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) Word has length 432 [2025-03-17 00:06:43,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:06:43,198 INFO L225 Difference]: With dead ends: 21014 [2025-03-17 00:06:43,198 INFO L226 Difference]: Without dead ends: 14126 [2025-03-17 00:06:43,264 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-17 00:06:43,265 INFO L435 NwaCegarLoop]: 468 mSDtfsCounter, 228 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 810 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:06:43,265 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 810 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:06:43,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14126 states. [2025-03-17 00:06:44,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14126 to 14020. [2025-03-17 00:06:44,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14020 states, 10679 states have (on average 1.4807566251521678) internal successors, (15813), 10735 states have internal predecessors, (15813), 3226 states have call successors, (3226), 114 states have call predecessors, (3226), 114 states have return successors, (3226), 3170 states have call predecessors, (3226), 3226 states have call successors, (3226) [2025-03-17 00:06:44,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14020 states to 14020 states and 22265 transitions. [2025-03-17 00:06:44,486 INFO L78 Accepts]: Start accepts. Automaton has 14020 states and 22265 transitions. Word has length 432 [2025-03-17 00:06:44,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:06:44,488 INFO L471 AbstractCegarLoop]: Abstraction has 14020 states and 22265 transitions. [2025-03-17 00:06:44,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-03-17 00:06:44,489 INFO L276 IsEmpty]: Start isEmpty. Operand 14020 states and 22265 transitions. [2025-03-17 00:06:44,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2025-03-17 00:06:44,493 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:06:44,494 INFO L218 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:06:44,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 00:06:44,494 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:06:44,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:06:44,495 INFO L85 PathProgramCache]: Analyzing trace with hash 2109621723, now seen corresponding path program 1 times [2025-03-17 00:06:44,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:06:44,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422811429] [2025-03-17 00:06:44,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:06:44,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:06:44,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 433 statements into 1 equivalence classes. [2025-03-17 00:06:44,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 433 of 433 statements. [2025-03-17 00:06:44,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:06:44,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:06:44,913 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked. [2025-03-17 00:06:44,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:06:44,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422811429] [2025-03-17 00:06:44,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422811429] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:06:44,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:06:44,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 00:06:44,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123550438] [2025-03-17 00:06:44,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:06:44,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 00:06:44,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:06:44,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 00:06:44,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 00:06:44,916 INFO L87 Difference]: Start difference. First operand 14020 states and 22265 transitions. Second operand has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-03-17 00:06:46,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:06:46,317 INFO L93 Difference]: Finished difference Result 31022 states and 49637 transitions. [2025-03-17 00:06:46,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 00:06:46,318 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) Word has length 433 [2025-03-17 00:06:46,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:06:46,418 INFO L225 Difference]: With dead ends: 31022 [2025-03-17 00:06:46,418 INFO L226 Difference]: Without dead ends: 25058 [2025-03-17 00:06:46,448 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 00:06:46,449 INFO L435 NwaCegarLoop]: 673 mSDtfsCounter, 344 mSDsluCounter, 981 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 1654 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 00:06:46,450 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 1654 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 00:06:46,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25058 states. [2025-03-17 00:06:47,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25058 to 7932. [2025-03-17 00:06:47,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7932 states, 6227 states have (on average 1.475991649269311) internal successors, (9191), 6255 states have internal predecessors, (9191), 1646 states have call successors, (1646), 58 states have call predecessors, (1646), 58 states have return successors, (1646), 1618 states have call predecessors, (1646), 1646 states have call successors, (1646) [2025-03-17 00:06:47,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7932 states to 7932 states and 12483 transitions. [2025-03-17 00:06:47,671 INFO L78 Accepts]: Start accepts. Automaton has 7932 states and 12483 transitions. Word has length 433 [2025-03-17 00:06:47,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:06:47,672 INFO L471 AbstractCegarLoop]: Abstraction has 7932 states and 12483 transitions. [2025-03-17 00:06:47,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-03-17 00:06:47,672 INFO L276 IsEmpty]: Start isEmpty. Operand 7932 states and 12483 transitions. [2025-03-17 00:06:47,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2025-03-17 00:06:47,678 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:06:47,678 INFO L218 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:06:47,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 00:06:47,678 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:06:47,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:06:47,679 INFO L85 PathProgramCache]: Analyzing trace with hash 835722328, now seen corresponding path program 1 times [2025-03-17 00:06:47,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:06:47,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312632157] [2025-03-17 00:06:47,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:06:47,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:06:47,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 433 statements into 1 equivalence classes. [2025-03-17 00:06:47,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 433 of 433 statements. [2025-03-17 00:06:47,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:06:47,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:06:50,939 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked. [2025-03-17 00:06:50,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:06:50,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312632157] [2025-03-17 00:06:50,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312632157] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:06:50,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:06:50,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 00:06:50,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499062697] [2025-03-17 00:06:50,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:06:50,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 00:06:50,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:06:50,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 00:06:50,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 00:06:50,941 INFO L87 Difference]: Start difference. First operand 7932 states and 12483 transitions. Second operand has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 states have internal predecessors, (106), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-03-17 00:06:52,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:06:52,939 INFO L93 Difference]: Finished difference Result 17157 states and 26671 transitions. [2025-03-17 00:06:52,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 00:06:52,940 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 states have internal predecessors, (106), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) Word has length 433 [2025-03-17 00:06:52,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:06:53,001 INFO L225 Difference]: With dead ends: 17157 [2025-03-17 00:06:53,001 INFO L226 Difference]: Without dead ends: 14967 [2025-03-17 00:06:53,014 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-17 00:06:53,015 INFO L435 NwaCegarLoop]: 477 mSDtfsCounter, 845 mSDsluCounter, 1272 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 266 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 845 SdHoareTripleChecker+Valid, 1749 SdHoareTripleChecker+Invalid, 814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 266 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:06:53,016 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [845 Valid, 1749 Invalid, 814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [266 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-17 00:06:53,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14967 states. [2025-03-17 00:06:53,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14967 to 9342. [2025-03-17 00:06:53,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9342 states, 7345 states have (on average 1.473927842069435) internal successors, (10826), 7381 states have internal predecessors, (10826), 1930 states have call successors, (1930), 66 states have call predecessors, (1930), 66 states have return successors, (1930), 1894 states have call predecessors, (1930), 1930 states have call successors, (1930) [2025-03-17 00:06:53,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9342 states to 9342 states and 14686 transitions. [2025-03-17 00:06:53,818 INFO L78 Accepts]: Start accepts. Automaton has 9342 states and 14686 transitions. Word has length 433 [2025-03-17 00:06:53,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:06:53,819 INFO L471 AbstractCegarLoop]: Abstraction has 9342 states and 14686 transitions. [2025-03-17 00:06:53,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 states have internal predecessors, (106), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-03-17 00:06:53,819 INFO L276 IsEmpty]: Start isEmpty. Operand 9342 states and 14686 transitions. [2025-03-17 00:06:53,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2025-03-17 00:06:53,823 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:06:53,823 INFO L218 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:06:53,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 00:06:53,823 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:06:53,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:06:53,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1861214327, now seen corresponding path program 1 times [2025-03-17 00:06:53,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:06:53,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075020034] [2025-03-17 00:06:53,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:06:53,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:06:53,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 433 statements into 1 equivalence classes. [2025-03-17 00:06:53,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 433 of 433 statements. [2025-03-17 00:06:53,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:06:53,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:06:54,134 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 108 proven. 87 refuted. 0 times theorem prover too weak. 8385 trivial. 0 not checked. [2025-03-17 00:06:54,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:06:54,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075020034] [2025-03-17 00:06:54,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075020034] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 00:06:54,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1669394121] [2025-03-17 00:06:54,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:06:54,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:06:54,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:06:54,137 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-17 00:06:54,139 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-17 00:06:54,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 433 statements into 1 equivalence classes. [2025-03-17 00:06:54,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 433 of 433 statements. [2025-03-17 00:06:54,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:06:54,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:06:54,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 990 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 00:06:54,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:06:54,678 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 4313 proven. 87 refuted. 0 times theorem prover too weak. 4180 trivial. 0 not checked. [2025-03-17 00:06:54,678 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 00:06:55,101 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 108 proven. 87 refuted. 0 times theorem prover too weak. 8385 trivial. 0 not checked. [2025-03-17 00:06:55,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1669394121] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 00:06:55,102 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 00:06:55,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 8 [2025-03-17 00:06:55,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485225340] [2025-03-17 00:06:55,102 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 00:06:55,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 00:06:55,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:06:55,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 00:06:55,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-17 00:06:55,104 INFO L87 Difference]: Start difference. First operand 9342 states and 14686 transitions. Second operand has 8 states, 8 states have (on average 17.25) internal successors, (138), 8 states have internal predecessors, (138), 3 states have call successors, (120), 2 states have call predecessors, (120), 4 states have return successors, (122), 3 states have call predecessors, (122), 3 states have call successors, (122) [2025-03-17 00:06:55,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:06:55,763 INFO L93 Difference]: Finished difference Result 13561 states and 21230 transitions. [2025-03-17 00:06:55,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 00:06:55,763 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 17.25) internal successors, (138), 8 states have internal predecessors, (138), 3 states have call successors, (120), 2 states have call predecessors, (120), 4 states have return successors, (122), 3 states have call predecessors, (122), 3 states have call successors, (122) Word has length 433 [2025-03-17 00:06:55,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:06:55,783 INFO L225 Difference]: With dead ends: 13561 [2025-03-17 00:06:55,784 INFO L226 Difference]: Without dead ends: 4602 [2025-03-17 00:06:55,800 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 873 GetRequests, 863 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2025-03-17 00:06:55,801 INFO L435 NwaCegarLoop]: 270 mSDtfsCounter, 637 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 673 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 00:06:55,801 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [673 Valid, 676 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 00:06:55,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4602 states. [2025-03-17 00:06:56,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4602 to 4542. [2025-03-17 00:06:56,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4542 states, 3588 states have (on average 1.4668338907469343) internal successors, (5263), 3604 states have internal predecessors, (5263), 910 states have call successors, (910), 43 states have call predecessors, (910), 43 states have return successors, (910), 894 states have call predecessors, (910), 910 states have call successors, (910) [2025-03-17 00:06:56,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4542 states to 4542 states and 7083 transitions. [2025-03-17 00:06:56,194 INFO L78 Accepts]: Start accepts. Automaton has 4542 states and 7083 transitions. Word has length 433 [2025-03-17 00:06:56,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:06:56,195 INFO L471 AbstractCegarLoop]: Abstraction has 4542 states and 7083 transitions. [2025-03-17 00:06:56,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 17.25) internal successors, (138), 8 states have internal predecessors, (138), 3 states have call successors, (120), 2 states have call predecessors, (120), 4 states have return successors, (122), 3 states have call predecessors, (122), 3 states have call successors, (122) [2025-03-17 00:06:56,195 INFO L276 IsEmpty]: Start isEmpty. Operand 4542 states and 7083 transitions. [2025-03-17 00:06:56,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2025-03-17 00:06:56,198 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:06:56,198 INFO L218 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:06:56,210 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 00:06:56,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-17 00:06:56,399 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:06:56,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:06:56,400 INFO L85 PathProgramCache]: Analyzing trace with hash -654671912, now seen corresponding path program 1 times [2025-03-17 00:06:56,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:06:56,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738294641] [2025-03-17 00:06:56,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:06:56,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:06:56,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 433 statements into 1 equivalence classes. [2025-03-17 00:06:56,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 433 of 433 statements. [2025-03-17 00:06:56,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:06:56,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:06:58,569 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked. [2025-03-17 00:06:58,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:06:58,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738294641] [2025-03-17 00:06:58,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738294641] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:06:58,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:06:58,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 00:06:58,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925636878] [2025-03-17 00:06:58,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:06:58,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 00:06:58,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:06:58,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 00:06:58,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 00:06:58,571 INFO L87 Difference]: Start difference. First operand 4542 states and 7083 transitions. Second operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-03-17 00:06:59,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:06:59,381 INFO L93 Difference]: Finished difference Result 5756 states and 8963 transitions. [2025-03-17 00:06:59,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 00:06:59,381 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) Word has length 433 [2025-03-17 00:06:59,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:06:59,397 INFO L225 Difference]: With dead ends: 5756 [2025-03-17 00:06:59,397 INFO L226 Difference]: Without dead ends: 4548 [2025-03-17 00:06:59,401 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 00:06:59,402 INFO L435 NwaCegarLoop]: 498 mSDtfsCounter, 525 mSDsluCounter, 959 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 200 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 1457 SdHoareTripleChecker+Invalid, 509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 200 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 00:06:59,402 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [525 Valid, 1457 Invalid, 509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [200 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 00:06:59,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4548 states. [2025-03-17 00:06:59,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4548 to 4544. [2025-03-17 00:06:59,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4544 states, 3590 states have (on average 1.466573816155989) internal successors, (5265), 3606 states have internal predecessors, (5265), 910 states have call successors, (910), 43 states have call predecessors, (910), 43 states have return successors, (910), 894 states have call predecessors, (910), 910 states have call successors, (910) [2025-03-17 00:06:59,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4544 states to 4544 states and 7085 transitions. [2025-03-17 00:06:59,774 INFO L78 Accepts]: Start accepts. Automaton has 4544 states and 7085 transitions. Word has length 433 [2025-03-17 00:06:59,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:06:59,775 INFO L471 AbstractCegarLoop]: Abstraction has 4544 states and 7085 transitions. [2025-03-17 00:06:59,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-03-17 00:06:59,775 INFO L276 IsEmpty]: Start isEmpty. Operand 4544 states and 7085 transitions. [2025-03-17 00:06:59,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2025-03-17 00:06:59,778 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:06:59,779 INFO L218 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:06:59,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 00:06:59,779 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:06:59,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:06:59,780 INFO L85 PathProgramCache]: Analyzing trace with hash 370820087, now seen corresponding path program 1 times [2025-03-17 00:06:59,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:06:59,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253173018] [2025-03-17 00:06:59,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:06:59,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:06:59,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 433 statements into 1 equivalence classes. [2025-03-17 00:06:59,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 433 of 433 statements. [2025-03-17 00:06:59,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:06:59,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:07:01,178 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 120 proven. 75 refuted. 0 times theorem prover too weak. 8385 trivial. 0 not checked. [2025-03-17 00:07:01,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:07:01,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253173018] [2025-03-17 00:07:01,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253173018] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 00:07:01,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2113798105] [2025-03-17 00:07:01,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:07:01,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:07:01,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:07:01,181 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 00:07:01,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 00:07:01,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 433 statements into 1 equivalence classes. [2025-03-17 00:07:01,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 433 of 433 statements. [2025-03-17 00:07:01,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:07:01,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:07:01,417 INFO L256 TraceCheckSpWp]: Trace formula consists of 989 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-17 00:07:01,425 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:07:02,584 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 4650 proven. 159 refuted. 0 times theorem prover too weak. 3771 trivial. 0 not checked. [2025-03-17 00:07:02,585 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 00:07:03,221 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 120 proven. 75 refuted. 0 times theorem prover too weak. 8385 trivial. 0 not checked. [2025-03-17 00:07:03,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2113798105] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 00:07:03,221 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 00:07:03,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12, 9] total 26 [2025-03-17 00:07:03,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698040315] [2025-03-17 00:07:03,221 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 00:07:03,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-17 00:07:03,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:07:03,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-17 00:07:03,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=507, Unknown=0, NotChecked=0, Total=650 [2025-03-17 00:07:03,223 INFO L87 Difference]: Start difference. First operand 4544 states and 7085 transitions. Second operand has 26 states, 26 states have (on average 9.26923076923077) internal successors, (241), 26 states have internal predecessors, (241), 6 states have call successors, (157), 4 states have call predecessors, (157), 8 states have return successors, (158), 6 states have call predecessors, (158), 6 states have call successors, (158) [2025-03-17 00:07:18,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:07:18,398 INFO L93 Difference]: Finished difference Result 53577 states and 82277 transitions. [2025-03-17 00:07:18,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 207 states. [2025-03-17 00:07:18,399 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 9.26923076923077) internal successors, (241), 26 states have internal predecessors, (241), 6 states have call successors, (157), 4 states have call predecessors, (157), 8 states have return successors, (158), 6 states have call predecessors, (158), 6 states have call successors, (158) Word has length 433 [2025-03-17 00:07:18,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:07:18,553 INFO L225 Difference]: With dead ends: 53577 [2025-03-17 00:07:18,554 INFO L226 Difference]: Without dead ends: 51516 [2025-03-17 00:07:18,581 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1095 GetRequests, 879 SyntacticMatches, 1 SemanticMatches, 215 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21560 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=8350, Invalid=38522, Unknown=0, NotChecked=0, Total=46872 [2025-03-17 00:07:18,583 INFO L435 NwaCegarLoop]: 528 mSDtfsCounter, 16438 mSDsluCounter, 5131 mSDsCounter, 0 mSdLazyCounter, 5051 mSolverCounterSat, 5839 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16571 SdHoareTripleChecker+Valid, 5659 SdHoareTripleChecker+Invalid, 10890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 5839 IncrementalHoareTripleChecker+Valid, 5051 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2025-03-17 00:07:18,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16571 Valid, 5659 Invalid, 10890 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [5839 Valid, 5051 Invalid, 0 Unknown, 0 Unchecked, 6.8s Time] [2025-03-17 00:07:18,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51516 states. [2025-03-17 00:07:20,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51516 to 22880. [2025-03-17 00:07:20,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22880 states, 18557 states have (on average 1.4625747696287115) internal successors, (27141), 18665 states have internal predecessors, (27141), 4072 states have call successors, (4072), 250 states have call predecessors, (4072), 250 states have return successors, (4072), 3964 states have call predecessors, (4072), 4072 states have call successors, (4072) [2025-03-17 00:07:20,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22880 states to 22880 states and 35285 transitions. [2025-03-17 00:07:20,991 INFO L78 Accepts]: Start accepts. Automaton has 22880 states and 35285 transitions. Word has length 433 [2025-03-17 00:07:20,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:07:20,991 INFO L471 AbstractCegarLoop]: Abstraction has 22880 states and 35285 transitions. [2025-03-17 00:07:20,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 9.26923076923077) internal successors, (241), 26 states have internal predecessors, (241), 6 states have call successors, (157), 4 states have call predecessors, (157), 8 states have return successors, (158), 6 states have call predecessors, (158), 6 states have call successors, (158) [2025-03-17 00:07:20,992 INFO L276 IsEmpty]: Start isEmpty. Operand 22880 states and 35285 transitions. [2025-03-17 00:07:20,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2025-03-17 00:07:20,999 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:07:20,999 INFO L218 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:07:21,009 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 00:07:21,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:07:21,200 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:07:21,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:07:21,202 INFO L85 PathProgramCache]: Analyzing trace with hash -728554014, now seen corresponding path program 1 times [2025-03-17 00:07:21,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:07:21,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338525040] [2025-03-17 00:07:21,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:07:21,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:07:21,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 433 statements into 1 equivalence classes. [2025-03-17 00:07:21,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 433 of 433 statements. [2025-03-17 00:07:21,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:07:21,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:07:21,455 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked. [2025-03-17 00:07:21,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:07:21,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338525040] [2025-03-17 00:07:21,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338525040] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:07:21,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:07:21,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 00:07:21,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269443020] [2025-03-17 00:07:21,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:07:21,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 00:07:21,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:07:21,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 00:07:21,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 00:07:21,458 INFO L87 Difference]: Start difference. First operand 22880 states and 35285 transitions. Second operand has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-03-17 00:07:24,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:07:24,278 INFO L93 Difference]: Finished difference Result 44673 states and 68856 transitions. [2025-03-17 00:07:24,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:07:24,279 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) Word has length 433 [2025-03-17 00:07:24,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:07:24,359 INFO L225 Difference]: With dead ends: 44673 [2025-03-17 00:07:24,359 INFO L226 Difference]: Without dead ends: 23675 [2025-03-17 00:07:24,406 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 00:07:24,407 INFO L435 NwaCegarLoop]: 463 mSDtfsCounter, 391 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 800 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 00:07:24,407 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 800 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 00:07:24,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23675 states. [2025-03-17 00:07:26,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23675 to 23641. [2025-03-17 00:07:26,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23641 states, 19145 states have (on average 1.4604857665186732) internal successors, (27961), 19256 states have internal predecessors, (27961), 4236 states have call successors, (4236), 259 states have call predecessors, (4236), 259 states have return successors, (4236), 4125 states have call predecessors, (4236), 4236 states have call successors, (4236) [2025-03-17 00:07:26,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23641 states to 23641 states and 36433 transitions. [2025-03-17 00:07:26,549 INFO L78 Accepts]: Start accepts. Automaton has 23641 states and 36433 transitions. Word has length 433 [2025-03-17 00:07:26,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:07:26,550 INFO L471 AbstractCegarLoop]: Abstraction has 23641 states and 36433 transitions. [2025-03-17 00:07:26,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-03-17 00:07:26,550 INFO L276 IsEmpty]: Start isEmpty. Operand 23641 states and 36433 transitions. [2025-03-17 00:07:26,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 435 [2025-03-17 00:07:26,558 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:07:26,558 INFO L218 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:07:26,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 00:07:26,559 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:07:26,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:07:26,559 INFO L85 PathProgramCache]: Analyzing trace with hash 324429668, now seen corresponding path program 1 times [2025-03-17 00:07:26,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:07:26,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168875458] [2025-03-17 00:07:26,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:07:26,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:07:26,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 434 statements into 1 equivalence classes. [2025-03-17 00:07:26,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 434 of 434 statements. [2025-03-17 00:07:26,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:07:26,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:07:27,268 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 135 proven. 60 refuted. 0 times theorem prover too weak. 8385 trivial. 0 not checked. [2025-03-17 00:07:27,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:07:27,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168875458] [2025-03-17 00:07:27,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168875458] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 00:07:27,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2055989988] [2025-03-17 00:07:27,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:07:27,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:07:27,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:07:27,273 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 00:07:27,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 00:07:27,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 434 statements into 1 equivalence classes. [2025-03-17 00:07:27,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 434 of 434 statements. [2025-03-17 00:07:27,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:07:27,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:07:27,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 990 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-17 00:07:27,519 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:07:27,896 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 4067 proven. 99 refuted. 0 times theorem prover too weak. 4414 trivial. 0 not checked. [2025-03-17 00:07:27,896 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 00:07:28,382 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 135 proven. 60 refuted. 0 times theorem prover too weak. 8385 trivial. 0 not checked. [2025-03-17 00:07:28,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2055989988] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 00:07:28,383 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 00:07:28,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 7] total 15 [2025-03-17 00:07:28,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659638606] [2025-03-17 00:07:28,383 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 00:07:28,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 00:07:28,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:07:28,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 00:07:28,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2025-03-17 00:07:28,384 INFO L87 Difference]: Start difference. First operand 23641 states and 36433 transitions. Second operand has 15 states, 15 states have (on average 14.266666666666667) internal successors, (214), 15 states have internal predecessors, (214), 4 states have call successors, (100), 3 states have call predecessors, (100), 6 states have return successors, (102), 4 states have call predecessors, (102), 4 states have call successors, (102) [2025-03-17 00:07:30,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:07:30,311 INFO L93 Difference]: Finished difference Result 37293 states and 57558 transitions. [2025-03-17 00:07:30,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-17 00:07:30,312 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 14.266666666666667) internal successors, (214), 15 states have internal predecessors, (214), 4 states have call successors, (100), 3 states have call predecessors, (100), 6 states have return successors, (102), 4 states have call predecessors, (102), 4 states have call successors, (102) Word has length 434 [2025-03-17 00:07:30,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:07:30,367 INFO L225 Difference]: With dead ends: 37293 [2025-03-17 00:07:30,367 INFO L226 Difference]: Without dead ends: 15574 [2025-03-17 00:07:30,410 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 885 GetRequests, 862 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=175, Invalid=377, Unknown=0, NotChecked=0, Total=552 [2025-03-17 00:07:30,412 INFO L435 NwaCegarLoop]: 333 mSDtfsCounter, 380 mSDsluCounter, 821 mSDsCounter, 0 mSdLazyCounter, 1228 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 424 SdHoareTripleChecker+Valid, 1154 SdHoareTripleChecker+Invalid, 1350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 1228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 00:07:30,412 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [424 Valid, 1154 Invalid, 1350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 1228 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 00:07:30,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15574 states. [2025-03-17 00:07:31,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15574 to 12477. [2025-03-17 00:07:31,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12477 states, 10062 states have (on average 1.4579606440071555) internal successors, (14670), 10112 states have internal predecessors, (14670), 2242 states have call successors, (2242), 172 states have call predecessors, (2242), 172 states have return successors, (2242), 2192 states have call predecessors, (2242), 2242 states have call successors, (2242) [2025-03-17 00:07:31,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12477 states to 12477 states and 19154 transitions. [2025-03-17 00:07:31,722 INFO L78 Accepts]: Start accepts. Automaton has 12477 states and 19154 transitions. Word has length 434 [2025-03-17 00:07:31,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:07:31,723 INFO L471 AbstractCegarLoop]: Abstraction has 12477 states and 19154 transitions. [2025-03-17 00:07:31,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 14.266666666666667) internal successors, (214), 15 states have internal predecessors, (214), 4 states have call successors, (100), 3 states have call predecessors, (100), 6 states have return successors, (102), 4 states have call predecessors, (102), 4 states have call successors, (102) [2025-03-17 00:07:31,723 INFO L276 IsEmpty]: Start isEmpty. Operand 12477 states and 19154 transitions. [2025-03-17 00:07:31,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 435 [2025-03-17 00:07:31,727 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:07:31,727 INFO L218 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:07:31,736 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-17 00:07:31,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-17 00:07:31,928 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:07:31,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:07:31,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1600400136, now seen corresponding path program 1 times [2025-03-17 00:07:31,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:07:31,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74066480] [2025-03-17 00:07:31,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:07:31,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:07:31,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 434 statements into 1 equivalence classes. [2025-03-17 00:07:32,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 434 of 434 statements. [2025-03-17 00:07:32,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:07:32,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:07:32,327 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 132 proven. 63 refuted. 0 times theorem prover too weak. 8385 trivial. 0 not checked. [2025-03-17 00:07:32,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:07:32,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74066480] [2025-03-17 00:07:32,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74066480] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 00:07:32,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1669614305] [2025-03-17 00:07:32,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:07:32,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:07:32,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:07:32,329 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 00:07:32,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 00:07:32,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 434 statements into 1 equivalence classes. [2025-03-17 00:07:32,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 434 of 434 statements. [2025-03-17 00:07:32,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:07:32,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:07:32,551 INFO L256 TraceCheckSpWp]: Trace formula consists of 990 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 00:07:32,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:07:33,021 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 3849 proven. 63 refuted. 0 times theorem prover too weak. 4668 trivial. 0 not checked. [2025-03-17 00:07:33,021 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 00:07:33,336 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 132 proven. 63 refuted. 0 times theorem prover too weak. 8385 trivial. 0 not checked. [2025-03-17 00:07:33,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1669614305] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 00:07:33,336 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 00:07:33,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 14 [2025-03-17 00:07:33,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692839490] [2025-03-17 00:07:33,337 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 00:07:33,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 00:07:33,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:07:33,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 00:07:33,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2025-03-17 00:07:33,338 INFO L87 Difference]: Start difference. First operand 12477 states and 19154 transitions. Second operand has 14 states, 14 states have (on average 15.571428571428571) internal successors, (218), 14 states have internal predecessors, (218), 6 states have call successors, (198), 3 states have call predecessors, (198), 6 states have return successors, (198), 6 states have call predecessors, (198), 6 states have call successors, (198) [2025-03-17 00:07:35,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:07:35,458 INFO L93 Difference]: Finished difference Result 25096 states and 38337 transitions. [2025-03-17 00:07:35,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 00:07:35,458 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 15.571428571428571) internal successors, (218), 14 states have internal predecessors, (218), 6 states have call successors, (198), 3 states have call predecessors, (198), 6 states have return successors, (198), 6 states have call predecessors, (198), 6 states have call successors, (198) Word has length 434 [2025-03-17 00:07:35,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:07:35,505 INFO L225 Difference]: With dead ends: 25096 [2025-03-17 00:07:35,505 INFO L226 Difference]: Without dead ends: 12801 [2025-03-17 00:07:35,532 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 876 GetRequests, 861 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=177, Unknown=0, NotChecked=0, Total=272 [2025-03-17 00:07:35,532 INFO L435 NwaCegarLoop]: 271 mSDtfsCounter, 797 mSDsluCounter, 813 mSDsCounter, 0 mSdLazyCounter, 675 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 841 SdHoareTripleChecker+Valid, 1084 SdHoareTripleChecker+Invalid, 781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 00:07:35,533 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [841 Valid, 1084 Invalid, 781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 675 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 00:07:35,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12801 states.