./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-79.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-79.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 e8de4db338607cfdc2dde250deee5323ac92f2ea0e390a4a3c7b66ce80371286 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 11:02:39,904 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 11:02:39,963 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 11:02:39,969 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 11:02:39,971 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 11:02:39,988 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 11:02:39,989 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 11:02:39,989 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 11:02:39,989 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 11:02:39,989 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 11:02:39,989 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 11:02:39,990 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 11:02:39,990 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 11:02:39,990 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 11:02:39,990 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 11:02:39,990 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 11:02:39,990 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 11:02:39,990 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 11:02:39,990 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 11:02:39,990 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 11:02:39,991 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 11:02:39,991 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 11:02:39,991 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 11:02:39,991 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 11:02:39,991 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 11:02:39,991 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 11:02:39,991 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 11:02:39,991 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 11:02:39,991 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 11:02:39,991 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 11:02:39,991 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 11:02:39,991 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 11:02:39,992 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 11:02:39,992 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 11:02:39,992 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 11:02:39,992 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 11:02:39,992 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 11:02:39,992 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 11:02:39,992 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 11:02:39,992 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 11:02:39,992 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 11:02:39,992 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 11:02:39,992 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 11:02:39,992 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 -> e8de4db338607cfdc2dde250deee5323ac92f2ea0e390a4a3c7b66ce80371286 [2025-03-08 11:02:40,207 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 11:02:40,216 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 11:02:40,218 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 11:02:40,219 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 11:02:40,220 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 11:02:40,220 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-79.i [2025-03-08 11:02:41,401 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/886e8e5e8/bf3bb8cd711f46cb80ad0b79ee489281/FLAG8d0230019 [2025-03-08 11:02:41,649 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 11:02:41,649 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-79.i [2025-03-08 11:02:41,656 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/886e8e5e8/bf3bb8cd711f46cb80ad0b79ee489281/FLAG8d0230019 [2025-03-08 11:02:41,981 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/886e8e5e8/bf3bb8cd711f46cb80ad0b79ee489281 [2025-03-08 11:02:41,982 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 11:02:41,983 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 11:02:41,984 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 11:02:41,984 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 11:02:41,987 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 11:02:41,988 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:02:41" (1/1) ... [2025-03-08 11:02:41,988 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43c19fd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:02:41, skipping insertion in model container [2025-03-08 11:02:41,988 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:02:41" (1/1) ... [2025-03-08 11:02:42,020 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 11:02:42,118 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-79.i[916,929] [2025-03-08 11:02:42,213 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 11:02:42,227 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 11:02:42,235 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-79.i[916,929] [2025-03-08 11:02:42,293 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 11:02:42,309 INFO L204 MainTranslator]: Completed translation [2025-03-08 11:02:42,309 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:02:42 WrapperNode [2025-03-08 11:02:42,310 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 11:02:42,310 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 11:02:42,311 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 11:02:42,311 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 11:02:42,314 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:02:42" (1/1) ... [2025-03-08 11:02:42,324 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:02:42" (1/1) ... [2025-03-08 11:02:42,359 INFO L138 Inliner]: procedures = 26, calls = 116, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 647 [2025-03-08 11:02:42,359 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 11:02:42,361 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 11:02:42,361 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 11:02:42,361 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 11:02:42,367 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:02:42" (1/1) ... [2025-03-08 11:02:42,367 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:02:42" (1/1) ... [2025-03-08 11:02:42,375 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:02:42" (1/1) ... [2025-03-08 11:02:42,397 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 11:02:42,400 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:02:42" (1/1) ... [2025-03-08 11:02:42,400 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:02:42" (1/1) ... [2025-03-08 11:02:42,416 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:02:42" (1/1) ... [2025-03-08 11:02:42,421 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:02:42" (1/1) ... [2025-03-08 11:02:42,423 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:02:42" (1/1) ... [2025-03-08 11:02:42,428 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:02:42" (1/1) ... [2025-03-08 11:02:42,434 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 11:02:42,435 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 11:02:42,435 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 11:02:42,435 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 11:02:42,436 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:02:42" (1/1) ... [2025-03-08 11:02:42,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 11:02:42,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:02:42,461 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 11:02:42,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 11:02:42,481 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 11:02:42,481 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 11:02:42,481 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 11:02:42,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 11:02:42,481 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 11:02:42,481 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 11:02:42,582 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 11:02:42,584 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 11:02:43,242 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-03-08 11:02:43,242 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 11:02:43,259 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 11:02:43,260 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-08 11:02:43,260 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:02:43 BoogieIcfgContainer [2025-03-08 11:02:43,260 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 11:02:43,262 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 11:02:43,262 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 11:02:43,265 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 11:02:43,265 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 11:02:41" (1/3) ... [2025-03-08 11:02:43,266 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d10b028 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:02:43, skipping insertion in model container [2025-03-08 11:02:43,266 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:02:42" (2/3) ... [2025-03-08 11:02:43,266 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d10b028 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:02:43, skipping insertion in model container [2025-03-08 11:02:43,266 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:02:43" (3/3) ... [2025-03-08 11:02:43,267 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-79.i [2025-03-08 11:02:43,277 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 11:02:43,279 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-79.i that has 2 procedures, 270 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 11:02:43,354 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 11:02:43,364 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;@d7733ca, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 11:02:43,365 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 11:02:43,370 INFO L276 IsEmpty]: Start isEmpty. Operand has 270 states, 164 states have (on average 1.4695121951219512) internal successors, (241), 165 states have internal predecessors, (241), 103 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 103 states have call predecessors, (103), 103 states have call successors, (103) [2025-03-08 11:02:43,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 633 [2025-03-08 11:02:43,400 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:02:43,401 INFO L218 NwaCegarLoop]: trace histogram [103, 103, 103, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:02:43,402 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:02:43,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:02:43,407 INFO L85 PathProgramCache]: Analyzing trace with hash 759613737, now seen corresponding path program 1 times [2025-03-08 11:02:43,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:02:43,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494652929] [2025-03-08 11:02:43,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:02:43,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:02:43,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 632 statements into 1 equivalence classes. [2025-03-08 11:02:43,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 632 of 632 statements. [2025-03-08 11:02:43,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:02:43,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:02:43,914 INFO L134 CoverageAnalysis]: Checked inductivity of 21012 backedges. 0 proven. 204 refuted. 0 times theorem prover too weak. 20808 trivial. 0 not checked. [2025-03-08 11:02:43,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:02:43,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494652929] [2025-03-08 11:02:43,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494652929] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 11:02:43,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [970266303] [2025-03-08 11:02:43,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:02:43,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:02:43,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:02:43,918 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 11:02:43,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 11:02:44,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 632 statements into 1 equivalence classes. [2025-03-08 11:02:44,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 632 of 632 statements. [2025-03-08 11:02:44,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:02:44,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:02:44,218 INFO L256 TraceCheckSpWp]: Trace formula consists of 1384 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 11:02:44,237 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:02:44,291 INFO L134 CoverageAnalysis]: Checked inductivity of 21012 backedges. 204 proven. 0 refuted. 0 times theorem prover too weak. 20808 trivial. 0 not checked. [2025-03-08 11:02:44,291 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 11:02:44,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [970266303] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:02:44,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 11:02:44,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 11:02:44,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164478628] [2025-03-08 11:02:44,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:02:44,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 11:02:44,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:02:44,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 11:02:44,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 11:02:44,318 INFO L87 Difference]: Start difference. First operand has 270 states, 164 states have (on average 1.4695121951219512) internal successors, (241), 165 states have internal predecessors, (241), 103 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 103 states have call predecessors, (103), 103 states have call successors, (103) Second operand has 2 states, 2 states have (on average 61.0) internal successors, (122), 2 states have internal predecessors, (122), 2 states have call successors, (103), 2 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 2 states have call successors, (103) [2025-03-08 11:02:44,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:02:44,391 INFO L93 Difference]: Finished difference Result 534 states and 992 transitions. [2025-03-08 11:02:44,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 11:02:44,396 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 61.0) internal successors, (122), 2 states have internal predecessors, (122), 2 states have call successors, (103), 2 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 2 states have call successors, (103) Word has length 632 [2025-03-08 11:02:44,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:02:44,403 INFO L225 Difference]: With dead ends: 534 [2025-03-08 11:02:44,404 INFO L226 Difference]: Without dead ends: 267 [2025-03-08 11:02:44,410 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 633 GetRequests, 633 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 11:02:44,413 INFO L435 NwaCegarLoop]: 432 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:02:44,414 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 432 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:02:44,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2025-03-08 11:02:44,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 267. [2025-03-08 11:02:44,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 162 states have (on average 1.4506172839506173) internal successors, (235), 162 states have internal predecessors, (235), 103 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 103 states have call predecessors, (103), 103 states have call successors, (103) [2025-03-08 11:02:44,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 441 transitions. [2025-03-08 11:02:44,489 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 441 transitions. Word has length 632 [2025-03-08 11:02:44,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:02:44,491 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 441 transitions. [2025-03-08 11:02:44,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 61.0) internal successors, (122), 2 states have internal predecessors, (122), 2 states have call successors, (103), 2 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 2 states have call successors, (103) [2025-03-08 11:02:44,492 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 441 transitions. [2025-03-08 11:02:44,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 633 [2025-03-08 11:02:44,513 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:02:44,513 INFO L218 NwaCegarLoop]: trace histogram [103, 103, 103, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:02:44,522 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 11:02:44,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 11:02:44,714 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:02:44,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:02:44,715 INFO L85 PathProgramCache]: Analyzing trace with hash -918825628, now seen corresponding path program 1 times [2025-03-08 11:02:44,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:02:44,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623787403] [2025-03-08 11:02:44,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:02:44,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:02:44,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 632 statements into 1 equivalence classes. [2025-03-08 11:02:44,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 632 of 632 statements. [2025-03-08 11:02:44,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:02:44,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:02:45,260 INFO L134 CoverageAnalysis]: Checked inductivity of 21012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21012 trivial. 0 not checked. [2025-03-08 11:02:45,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:02:45,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623787403] [2025-03-08 11:02:45,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623787403] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:02:45,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:02:45,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:02:45,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567618082] [2025-03-08 11:02:45,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:02:45,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:02:45,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:02:45,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:02:45,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:02:45,264 INFO L87 Difference]: Start difference. First operand 267 states and 441 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) [2025-03-08 11:02:45,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:02:45,344 INFO L93 Difference]: Finished difference Result 669 states and 1106 transitions. [2025-03-08 11:02:45,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:02:45,348 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) Word has length 632 [2025-03-08 11:02:45,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:02:45,354 INFO L225 Difference]: With dead ends: 669 [2025-03-08 11:02:45,355 INFO L226 Difference]: Without dead ends: 405 [2025-03-08 11:02:45,358 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:02:45,359 INFO L435 NwaCegarLoop]: 585 mSDtfsCounter, 203 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 1006 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-08 11:02:45,359 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 1006 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:02:45,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2025-03-08 11:02:45,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 402. [2025-03-08 11:02:45,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 255 states have (on average 1.4784313725490197) internal successors, (377), 256 states have internal predecessors, (377), 144 states have call successors, (144), 2 states have call predecessors, (144), 2 states have return successors, (144), 143 states have call predecessors, (144), 144 states have call successors, (144) [2025-03-08 11:02:45,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 665 transitions. [2025-03-08 11:02:45,424 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 665 transitions. Word has length 632 [2025-03-08 11:02:45,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:02:45,425 INFO L471 AbstractCegarLoop]: Abstraction has 402 states and 665 transitions. [2025-03-08 11:02:45,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) [2025-03-08 11:02:45,425 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 665 transitions. [2025-03-08 11:02:45,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 634 [2025-03-08 11:02:45,435 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:02:45,435 INFO L218 NwaCegarLoop]: trace histogram [103, 103, 103, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:02:45,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 11:02:45,436 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:02:45,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:02:45,436 INFO L85 PathProgramCache]: Analyzing trace with hash -36726039, now seen corresponding path program 1 times [2025-03-08 11:02:45,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:02:45,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930103052] [2025-03-08 11:02:45,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:02:45,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:02:45,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 633 statements into 1 equivalence classes. [2025-03-08 11:02:45,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 633 of 633 statements. [2025-03-08 11:02:45,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:02:45,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:02:45,935 INFO L134 CoverageAnalysis]: Checked inductivity of 21012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21012 trivial. 0 not checked. [2025-03-08 11:02:45,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:02:45,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930103052] [2025-03-08 11:02:45,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930103052] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:02:45,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:02:45,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 11:02:45,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058044737] [2025-03-08 11:02:45,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:02:45,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 11:02:45,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:02:45,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 11:02:45,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 11:02:45,941 INFO L87 Difference]: Start difference. First operand 402 states and 665 transitions. Second operand has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) [2025-03-08 11:02:46,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:02:46,699 INFO L93 Difference]: Finished difference Result 1744 states and 2896 transitions. [2025-03-08 11:02:46,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 11:02:46,700 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) Word has length 633 [2025-03-08 11:02:46,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:02:46,721 INFO L225 Difference]: With dead ends: 1744 [2025-03-08 11:02:46,721 INFO L226 Difference]: Without dead ends: 1345 [2025-03-08 11:02:46,723 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 11:02:46,723 INFO L435 NwaCegarLoop]: 628 mSDtfsCounter, 1009 mSDsluCounter, 894 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1009 SdHoareTripleChecker+Valid, 1522 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 11:02:46,724 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1009 Valid, 1522 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 11:02:46,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1345 states. [2025-03-08 11:02:46,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1345 to 1335. [2025-03-08 11:02:46,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1335 states, 906 states have (on average 1.5242825607064017) internal successors, (1381), 912 states have internal predecessors, (1381), 420 states have call successors, (420), 8 states have call predecessors, (420), 8 states have return successors, (420), 414 states have call predecessors, (420), 420 states have call successors, (420) [2025-03-08 11:02:46,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1335 states to 1335 states and 2221 transitions. [2025-03-08 11:02:46,855 INFO L78 Accepts]: Start accepts. Automaton has 1335 states and 2221 transitions. Word has length 633 [2025-03-08 11:02:46,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:02:46,856 INFO L471 AbstractCegarLoop]: Abstraction has 1335 states and 2221 transitions. [2025-03-08 11:02:46,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) [2025-03-08 11:02:46,857 INFO L276 IsEmpty]: Start isEmpty. Operand 1335 states and 2221 transitions. [2025-03-08 11:02:46,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 634 [2025-03-08 11:02:46,864 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:02:46,864 INFO L218 NwaCegarLoop]: trace histogram [103, 103, 103, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:02:46,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 11:02:46,864 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:02:46,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:02:46,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1096464554, now seen corresponding path program 1 times [2025-03-08 11:02:46,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:02:46,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339907651] [2025-03-08 11:02:46,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:02:46,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:02:46,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 633 statements into 1 equivalence classes. [2025-03-08 11:02:46,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 633 of 633 statements. [2025-03-08 11:02:46,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:02:46,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:02:47,180 INFO L134 CoverageAnalysis]: Checked inductivity of 21012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21012 trivial. 0 not checked. [2025-03-08 11:02:47,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:02:47,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339907651] [2025-03-08 11:02:47,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339907651] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:02:47,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:02:47,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 11:02:47,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949110664] [2025-03-08 11:02:47,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:02:47,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 11:02:47,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:02:47,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 11:02:47,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 11:02:47,183 INFO L87 Difference]: Start difference. First operand 1335 states and 2221 transitions. Second operand has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) [2025-03-08 11:02:47,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:02:47,649 INFO L93 Difference]: Finished difference Result 4060 states and 6718 transitions. [2025-03-08 11:02:47,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 11:02:47,650 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) Word has length 633 [2025-03-08 11:02:47,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:02:47,667 INFO L225 Difference]: With dead ends: 4060 [2025-03-08 11:02:47,667 INFO L226 Difference]: Without dead ends: 2728 [2025-03-08 11:02:47,672 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-08 11:02:47,673 INFO L435 NwaCegarLoop]: 726 mSDtfsCounter, 709 mSDsluCounter, 722 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 709 SdHoareTripleChecker+Valid, 1448 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 11:02:47,673 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [709 Valid, 1448 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 11:02:47,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2728 states. [2025-03-08 11:02:47,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2728 to 2722. [2025-03-08 11:02:47,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2722 states, 1755 states have (on average 1.4786324786324787) internal successors, (2595), 1770 states have internal predecessors, (2595), 948 states have call successors, (948), 18 states have call predecessors, (948), 18 states have return successors, (948), 933 states have call predecessors, (948), 948 states have call successors, (948) [2025-03-08 11:02:47,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2722 states to 2722 states and 4491 transitions. [2025-03-08 11:02:47,922 INFO L78 Accepts]: Start accepts. Automaton has 2722 states and 4491 transitions. Word has length 633 [2025-03-08 11:02:47,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:02:47,923 INFO L471 AbstractCegarLoop]: Abstraction has 2722 states and 4491 transitions. [2025-03-08 11:02:47,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) [2025-03-08 11:02:47,924 INFO L276 IsEmpty]: Start isEmpty. Operand 2722 states and 4491 transitions. [2025-03-08 11:02:47,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 634 [2025-03-08 11:02:47,947 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:02:47,948 INFO L218 NwaCegarLoop]: trace histogram [103, 103, 103, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:02:47,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 11:02:47,948 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:02:47,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:02:47,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1127484361, now seen corresponding path program 1 times [2025-03-08 11:02:47,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:02:47,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308879793] [2025-03-08 11:02:47,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:02:47,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:02:47,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 633 statements into 1 equivalence classes. [2025-03-08 11:02:48,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 633 of 633 statements. [2025-03-08 11:02:48,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:02:48,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:02:48,351 INFO L134 CoverageAnalysis]: Checked inductivity of 21012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21012 trivial. 0 not checked. [2025-03-08 11:02:48,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:02:48,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308879793] [2025-03-08 11:02:48,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308879793] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:02:48,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:02:48,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:02:48,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068517583] [2025-03-08 11:02:48,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:02:48,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:02:48,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:02:48,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:02:48,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:02:48,355 INFO L87 Difference]: Start difference. First operand 2722 states and 4491 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) [2025-03-08 11:02:48,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:02:48,653 INFO L93 Difference]: Finished difference Result 8160 states and 13467 transitions. [2025-03-08 11:02:48,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:02:48,654 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) Word has length 633 [2025-03-08 11:02:48,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:02:48,689 INFO L225 Difference]: With dead ends: 8160 [2025-03-08 11:02:48,689 INFO L226 Difference]: Without dead ends: 5441 [2025-03-08 11:02:48,701 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:02:48,702 INFO L435 NwaCegarLoop]: 436 mSDtfsCounter, 223 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 858 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:02:48,702 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 858 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:02:48,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5441 states. [2025-03-08 11:02:49,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5441 to 5439. [2025-03-08 11:02:49,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5439 states, 3506 states have (on average 1.4689104392470052) internal successors, (5150), 3536 states have internal predecessors, (5150), 1896 states have call successors, (1896), 36 states have call predecessors, (1896), 36 states have return successors, (1896), 1866 states have call predecessors, (1896), 1896 states have call successors, (1896) [2025-03-08 11:02:49,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5439 states to 5439 states and 8942 transitions. [2025-03-08 11:02:49,156 INFO L78 Accepts]: Start accepts. Automaton has 5439 states and 8942 transitions. Word has length 633 [2025-03-08 11:02:49,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:02:49,157 INFO L471 AbstractCegarLoop]: Abstraction has 5439 states and 8942 transitions. [2025-03-08 11:02:49,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) [2025-03-08 11:02:49,157 INFO L276 IsEmpty]: Start isEmpty. Operand 5439 states and 8942 transitions. [2025-03-08 11:02:49,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 635 [2025-03-08 11:02:49,163 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:02:49,163 INFO L218 NwaCegarLoop]: trace histogram [103, 103, 103, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:02:49,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 11:02:49,163 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:02:49,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:02:49,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1433975515, now seen corresponding path program 1 times [2025-03-08 11:02:49,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:02:49,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773101971] [2025-03-08 11:02:49,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:02:49,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:02:49,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 634 statements into 1 equivalence classes. [2025-03-08 11:02:49,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 634 of 634 statements. [2025-03-08 11:02:49,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:02:49,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:02:49,912 INFO L134 CoverageAnalysis]: Checked inductivity of 21012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21012 trivial. 0 not checked. [2025-03-08 11:02:49,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:02:49,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773101971] [2025-03-08 11:02:49,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773101971] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:02:49,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:02:49,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 11:02:49,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198039875] [2025-03-08 11:02:49,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:02:49,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 11:02:49,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:02:49,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 11:02:49,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 11:02:49,914 INFO L87 Difference]: Start difference. First operand 5439 states and 8942 transitions. Second operand has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) [2025-03-08 11:02:50,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:02:50,619 INFO L93 Difference]: Finished difference Result 11095 states and 18225 transitions. [2025-03-08 11:02:50,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 11:02:50,619 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) Word has length 634 [2025-03-08 11:02:50,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:02:50,655 INFO L225 Difference]: With dead ends: 11095 [2025-03-08 11:02:50,655 INFO L226 Difference]: Without dead ends: 5659 [2025-03-08 11:02:50,671 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-08 11:02:50,672 INFO L435 NwaCegarLoop]: 434 mSDtfsCounter, 366 mSDsluCounter, 1071 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 310 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 1505 SdHoareTripleChecker+Invalid, 577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 310 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 11:02:50,673 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 1505 Invalid, 577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [310 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 11:02:50,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5659 states. [2025-03-08 11:02:51,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5659 to 5439. [2025-03-08 11:02:51,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5439 states, 3506 states have (on average 1.4637763833428408) internal successors, (5132), 3536 states have internal predecessors, (5132), 1896 states have call successors, (1896), 36 states have call predecessors, (1896), 36 states have return successors, (1896), 1866 states have call predecessors, (1896), 1896 states have call successors, (1896) [2025-03-08 11:02:51,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5439 states to 5439 states and 8924 transitions. [2025-03-08 11:02:51,084 INFO L78 Accepts]: Start accepts. Automaton has 5439 states and 8924 transitions. Word has length 634 [2025-03-08 11:02:51,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:02:51,085 INFO L471 AbstractCegarLoop]: Abstraction has 5439 states and 8924 transitions. [2025-03-08 11:02:51,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) [2025-03-08 11:02:51,089 INFO L276 IsEmpty]: Start isEmpty. Operand 5439 states and 8924 transitions. [2025-03-08 11:02:51,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 636 [2025-03-08 11:02:51,095 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:02:51,095 INFO L218 NwaCegarLoop]: trace histogram [103, 103, 103, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:02:51,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 11:02:51,095 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:02:51,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:02:51,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1214142347, now seen corresponding path program 1 times [2025-03-08 11:02:51,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:02:51,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776714865] [2025-03-08 11:02:51,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:02:51,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:02:51,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 635 statements into 1 equivalence classes. [2025-03-08 11:02:51,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 635 of 635 statements. [2025-03-08 11:02:51,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:02:51,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:02:51,450 INFO L134 CoverageAnalysis]: Checked inductivity of 21012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21012 trivial. 0 not checked. [2025-03-08 11:02:51,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:02:51,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776714865] [2025-03-08 11:02:51,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776714865] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:02:51,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:02:51,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:02:51,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964802594] [2025-03-08 11:02:51,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:02:51,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:02:51,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:02:51,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:02:51,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:02:51,456 INFO L87 Difference]: Start difference. First operand 5439 states and 8924 transitions. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) [2025-03-08 11:02:51,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:02:51,685 INFO L93 Difference]: Finished difference Result 11055 states and 18169 transitions. [2025-03-08 11:02:51,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:02:51,686 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) Word has length 635 [2025-03-08 11:02:51,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:02:51,721 INFO L225 Difference]: With dead ends: 11055 [2025-03-08 11:02:51,722 INFO L226 Difference]: Without dead ends: 5619 [2025-03-08 11:02:51,742 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:02:51,742 INFO L435 NwaCegarLoop]: 448 mSDtfsCounter, 18 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 871 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:02:51,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 871 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:02:51,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5619 states. [2025-03-08 11:02:52,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5619 to 5439. [2025-03-08 11:02:52,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5439 states, 3506 states have (on average 1.4535082715345122) internal successors, (5096), 3536 states have internal predecessors, (5096), 1896 states have call successors, (1896), 36 states have call predecessors, (1896), 36 states have return successors, (1896), 1866 states have call predecessors, (1896), 1896 states have call successors, (1896) [2025-03-08 11:02:52,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5439 states to 5439 states and 8888 transitions. [2025-03-08 11:02:52,271 INFO L78 Accepts]: Start accepts. Automaton has 5439 states and 8888 transitions. Word has length 635 [2025-03-08 11:02:52,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:02:52,272 INFO L471 AbstractCegarLoop]: Abstraction has 5439 states and 8888 transitions. [2025-03-08 11:02:52,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) [2025-03-08 11:02:52,273 INFO L276 IsEmpty]: Start isEmpty. Operand 5439 states and 8888 transitions. [2025-03-08 11:02:52,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 636 [2025-03-08 11:02:52,281 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:02:52,281 INFO L218 NwaCegarLoop]: trace histogram [103, 103, 103, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:02:52,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 11:02:52,281 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:02:52,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:02:52,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1343225066, now seen corresponding path program 1 times [2025-03-08 11:02:52,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:02:52,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663193710] [2025-03-08 11:02:52,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:02:52,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:02:52,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 635 statements into 1 equivalence classes. [2025-03-08 11:02:52,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 635 of 635 statements. [2025-03-08 11:02:52,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:02:52,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:02:55,333 INFO L134 CoverageAnalysis]: Checked inductivity of 21012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21012 trivial. 0 not checked. [2025-03-08 11:02:55,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:02:55,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663193710] [2025-03-08 11:02:55,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663193710] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:02:55,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:02:55,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 11:02:55,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638809450] [2025-03-08 11:02:55,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:02:55,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 11:02:55,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:02:55,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 11:02:55,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 11:02:55,335 INFO L87 Difference]: Start difference. First operand 5439 states and 8888 transitions. Second operand has 7 states, 7 states have (on average 17.571428571428573) internal successors, (123), 7 states have internal predecessors, (123), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) [2025-03-08 11:02:59,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:02:59,170 INFO L93 Difference]: Finished difference Result 16711 states and 27351 transitions. [2025-03-08 11:02:59,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 11:02:59,171 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.571428571428573) internal successors, (123), 7 states have internal predecessors, (123), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) Word has length 635 [2025-03-08 11:02:59,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:02:59,223 INFO L225 Difference]: With dead ends: 16711 [2025-03-08 11:02:59,224 INFO L226 Difference]: Without dead ends: 11275 [2025-03-08 11:02:59,239 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-08 11:02:59,239 INFO L435 NwaCegarLoop]: 737 mSDtfsCounter, 591 mSDsluCounter, 1986 mSDsCounter, 0 mSdLazyCounter, 931 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 591 SdHoareTripleChecker+Valid, 2723 SdHoareTripleChecker+Invalid, 933 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 931 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:02:59,240 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [591 Valid, 2723 Invalid, 933 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 931 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-08 11:02:59,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11275 states. [2025-03-08 11:03:00,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11275 to 6022. [2025-03-08 11:03:00,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6022 states, 4030 states have (on average 1.4858560794044664) internal successors, (5988), 4061 states have internal predecessors, (5988), 1945 states have call successors, (1945), 46 states have call predecessors, (1945), 46 states have return successors, (1945), 1914 states have call predecessors, (1945), 1945 states have call successors, (1945) [2025-03-08 11:03:00,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6022 states to 6022 states and 9878 transitions. [2025-03-08 11:03:00,338 INFO L78 Accepts]: Start accepts. Automaton has 6022 states and 9878 transitions. Word has length 635 [2025-03-08 11:03:00,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:03:00,339 INFO L471 AbstractCegarLoop]: Abstraction has 6022 states and 9878 transitions. [2025-03-08 11:03:00,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.571428571428573) internal successors, (123), 7 states have internal predecessors, (123), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) [2025-03-08 11:03:00,339 INFO L276 IsEmpty]: Start isEmpty. Operand 6022 states and 9878 transitions. [2025-03-08 11:03:00,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 637 [2025-03-08 11:03:00,346 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:03:00,346 INFO L218 NwaCegarLoop]: trace histogram [103, 103, 103, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:03:00,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 11:03:00,347 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:03:00,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:03:00,347 INFO L85 PathProgramCache]: Analyzing trace with hash -2051902229, now seen corresponding path program 1 times [2025-03-08 11:03:00,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:03:00,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705820197] [2025-03-08 11:03:00,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:03:00,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:03:00,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 636 statements into 1 equivalence classes. [2025-03-08 11:03:00,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 636 of 636 statements. [2025-03-08 11:03:00,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:03:00,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:03:00,788 INFO L134 CoverageAnalysis]: Checked inductivity of 21012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21012 trivial. 0 not checked. [2025-03-08 11:03:00,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:03:00,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705820197] [2025-03-08 11:03:00,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705820197] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:03:00,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:03:00,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:03:00,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176438404] [2025-03-08 11:03:00,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:03:00,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:03:00,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:03:00,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:03:00,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:03:00,790 INFO L87 Difference]: Start difference. First operand 6022 states and 9878 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) [2025-03-08 11:03:01,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:03:01,427 INFO L93 Difference]: Finished difference Result 12106 states and 19733 transitions. [2025-03-08 11:03:01,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:03:01,428 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) Word has length 636 [2025-03-08 11:03:01,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:03:01,456 INFO L225 Difference]: With dead ends: 12106 [2025-03-08 11:03:01,456 INFO L226 Difference]: Without dead ends: 6166 [2025-03-08 11:03:01,471 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:03:01,472 INFO L435 NwaCegarLoop]: 440 mSDtfsCounter, 32 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 843 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:03:01,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 843 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:03:01,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6166 states. [2025-03-08 11:03:02,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6166 to 6166. [2025-03-08 11:03:02,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6166 states, 4138 states have (on average 1.4644755920734653) internal successors, (6060), 4169 states have internal predecessors, (6060), 1945 states have call successors, (1945), 82 states have call predecessors, (1945), 82 states have return successors, (1945), 1914 states have call predecessors, (1945), 1945 states have call successors, (1945) [2025-03-08 11:03:02,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6166 states to 6166 states and 9950 transitions. [2025-03-08 11:03:02,196 INFO L78 Accepts]: Start accepts. Automaton has 6166 states and 9950 transitions. Word has length 636 [2025-03-08 11:03:02,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:03:02,196 INFO L471 AbstractCegarLoop]: Abstraction has 6166 states and 9950 transitions. [2025-03-08 11:03:02,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) [2025-03-08 11:03:02,197 INFO L276 IsEmpty]: Start isEmpty. Operand 6166 states and 9950 transitions. [2025-03-08 11:03:02,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 638 [2025-03-08 11:03:02,202 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:03:02,202 INFO L218 NwaCegarLoop]: trace histogram [103, 103, 103, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:03:02,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 11:03:02,202 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:03:02,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:03:02,203 INFO L85 PathProgramCache]: Analyzing trace with hash 153892408, now seen corresponding path program 1 times [2025-03-08 11:03:02,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:03:02,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811906225] [2025-03-08 11:03:02,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:03:02,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:03:02,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 637 statements into 1 equivalence classes. [2025-03-08 11:03:02,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 637 of 637 statements. [2025-03-08 11:03:02,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:03:02,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:03:06,690 INFO L134 CoverageAnalysis]: Checked inductivity of 21012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21012 trivial. 0 not checked. [2025-03-08 11:03:06,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:03:06,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811906225] [2025-03-08 11:03:06,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811906225] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:03:06,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:03:06,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 11:03:06,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965551473] [2025-03-08 11:03:06,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:03:06,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 11:03:06,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:03:06,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 11:03:06,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-08 11:03:06,692 INFO L87 Difference]: Start difference. First operand 6166 states and 9950 transitions. Second operand has 10 states, 10 states have (on average 12.5) internal successors, (125), 10 states have internal predecessors, (125), 2 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 2 states have call predecessors, (103), 2 states have call successors, (103) [2025-03-08 11:03:23,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:03:23,316 INFO L93 Difference]: Finished difference Result 41060 states and 66343 transitions. [2025-03-08 11:03:23,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 11:03:23,316 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.5) internal successors, (125), 10 states have internal predecessors, (125), 2 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 2 states have call predecessors, (103), 2 states have call successors, (103) Word has length 637 [2025-03-08 11:03:23,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:03:23,423 INFO L225 Difference]: With dead ends: 41060 [2025-03-08 11:03:23,423 INFO L226 Difference]: Without dead ends: 34976 [2025-03-08 11:03:23,446 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=161, Invalid=301, Unknown=0, NotChecked=0, Total=462 [2025-03-08 11:03:23,447 INFO L435 NwaCegarLoop]: 733 mSDtfsCounter, 2389 mSDsluCounter, 1524 mSDsCounter, 0 mSdLazyCounter, 1889 mSolverCounterSat, 895 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2389 SdHoareTripleChecker+Valid, 2257 SdHoareTripleChecker+Invalid, 2784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 895 IncrementalHoareTripleChecker+Valid, 1889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.6s IncrementalHoareTripleChecker+Time [2025-03-08 11:03:23,447 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2389 Valid, 2257 Invalid, 2784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [895 Valid, 1889 Invalid, 0 Unknown, 0 Unchecked, 9.6s Time] [2025-03-08 11:03:23,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34976 states. [2025-03-08 11:03:26,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34976 to 15778. [2025-03-08 11:03:26,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15778 states, 11169 states have (on average 1.4849136001432537) internal successors, (16585), 11272 states have internal predecessors, (16585), 4345 states have call successors, (4345), 263 states have call predecessors, (4345), 263 states have return successors, (4345), 4242 states have call predecessors, (4345), 4345 states have call successors, (4345) [2025-03-08 11:03:26,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15778 states to 15778 states and 25275 transitions. [2025-03-08 11:03:26,613 INFO L78 Accepts]: Start accepts. Automaton has 15778 states and 25275 transitions. Word has length 637 [2025-03-08 11:03:26,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:03:26,614 INFO L471 AbstractCegarLoop]: Abstraction has 15778 states and 25275 transitions. [2025-03-08 11:03:26,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.5) internal successors, (125), 10 states have internal predecessors, (125), 2 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 2 states have call predecessors, (103), 2 states have call successors, (103) [2025-03-08 11:03:26,614 INFO L276 IsEmpty]: Start isEmpty. Operand 15778 states and 25275 transitions. [2025-03-08 11:03:26,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 638 [2025-03-08 11:03:26,623 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:03:26,623 INFO L218 NwaCegarLoop]: trace histogram [103, 103, 103, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:03:26,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 11:03:26,623 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:03:26,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:03:26,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1856211433, now seen corresponding path program 1 times [2025-03-08 11:03:26,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:03:26,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632162941] [2025-03-08 11:03:26,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:03:26,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:03:26,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 637 statements into 1 equivalence classes. [2025-03-08 11:03:26,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 637 of 637 statements. [2025-03-08 11:03:26,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:03:26,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:03:27,962 INFO L134 CoverageAnalysis]: Checked inductivity of 21012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21012 trivial. 0 not checked. [2025-03-08 11:03:27,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:03:27,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632162941] [2025-03-08 11:03:27,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632162941] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:03:27,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:03:27,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 11:03:27,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951530249] [2025-03-08 11:03:27,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:03:27,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 11:03:27,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:03:27,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 11:03:27,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-08 11:03:27,966 INFO L87 Difference]: Start difference. First operand 15778 states and 25275 transitions. Second operand has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 2 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 2 states have call predecessors, (103), 2 states have call successors, (103) [2025-03-08 11:03:31,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:03:31,521 INFO L93 Difference]: Finished difference Result 32618 states and 52578 transitions. [2025-03-08 11:03:31,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 11:03:31,522 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 2 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 2 states have call predecessors, (103), 2 states have call successors, (103) Word has length 637 [2025-03-08 11:03:31,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:03:31,578 INFO L225 Difference]: With dead ends: 32618 [2025-03-08 11:03:31,578 INFO L226 Difference]: Without dead ends: 16926 [2025-03-08 11:03:31,611 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-03-08 11:03:31,611 INFO L435 NwaCegarLoop]: 526 mSDtfsCounter, 941 mSDsluCounter, 719 mSDsCounter, 0 mSdLazyCounter, 759 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 941 SdHoareTripleChecker+Valid, 1245 SdHoareTripleChecker+Invalid, 872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 11:03:31,612 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [941 Valid, 1245 Invalid, 872 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 759 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 11:03:31,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16926 states. [2025-03-08 11:03:33,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16926 to 10774. [2025-03-08 11:03:33,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10774 states, 7701 states have (on average 1.4970783015192832) internal successors, (11529), 7768 states have internal predecessors, (11529), 2917 states have call successors, (2917), 155 states have call predecessors, (2917), 155 states have return successors, (2917), 2850 states have call predecessors, (2917), 2917 states have call successors, (2917) [2025-03-08 11:03:33,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10774 states to 10774 states and 17363 transitions. [2025-03-08 11:03:33,680 INFO L78 Accepts]: Start accepts. Automaton has 10774 states and 17363 transitions. Word has length 637 [2025-03-08 11:03:33,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:03:33,681 INFO L471 AbstractCegarLoop]: Abstraction has 10774 states and 17363 transitions. [2025-03-08 11:03:33,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 2 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 2 states have call predecessors, (103), 2 states have call successors, (103) [2025-03-08 11:03:33,681 INFO L276 IsEmpty]: Start isEmpty. Operand 10774 states and 17363 transitions. [2025-03-08 11:03:33,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 638 [2025-03-08 11:03:33,692 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:03:33,692 INFO L218 NwaCegarLoop]: trace histogram [103, 103, 103, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:03:33,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 11:03:33,692 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:03:33,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:03:33,693 INFO L85 PathProgramCache]: Analyzing trace with hash 483658169, now seen corresponding path program 1 times [2025-03-08 11:03:33,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:03:33,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5857736] [2025-03-08 11:03:33,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:03:33,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:03:33,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 637 statements into 1 equivalence classes. [2025-03-08 11:03:33,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 637 of 637 statements. [2025-03-08 11:03:33,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:03:33,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:03:34,723 INFO L134 CoverageAnalysis]: Checked inductivity of 21012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21012 trivial. 0 not checked. [2025-03-08 11:03:34,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:03:34,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5857736] [2025-03-08 11:03:34,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5857736] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:03:34,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:03:34,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 11:03:34,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660297093] [2025-03-08 11:03:34,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:03:34,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 11:03:34,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:03:34,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 11:03:34,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 11:03:34,725 INFO L87 Difference]: Start difference. First operand 10774 states and 17363 transitions. Second operand has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) [2025-03-08 11:03:38,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:03:38,350 INFO L93 Difference]: Finished difference Result 29644 states and 47750 transitions. [2025-03-08 11:03:38,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 11:03:38,351 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) Word has length 637 [2025-03-08 11:03:38,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:03:38,416 INFO L225 Difference]: With dead ends: 29644 [2025-03-08 11:03:38,416 INFO L226 Difference]: Without dead ends: 18956 [2025-03-08 11:03:38,443 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 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-08 11:03:38,444 INFO L435 NwaCegarLoop]: 488 mSDtfsCounter, 451 mSDsluCounter, 824 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 451 SdHoareTripleChecker+Valid, 1312 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 11:03:38,444 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [451 Valid, 1312 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 11:03:38,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18956 states. [2025-03-08 11:03:41,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18956 to 18028. [2025-03-08 11:03:41,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18028 states, 13275 states have (on average 1.513295668549906) internal successors, (20089), 13398 states have internal predecessors, (20089), 4485 states have call successors, (4485), 267 states have call predecessors, (4485), 267 states have return successors, (4485), 4362 states have call predecessors, (4485), 4485 states have call successors, (4485) [2025-03-08 11:03:41,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18028 states to 18028 states and 29059 transitions. [2025-03-08 11:03:41,520 INFO L78 Accepts]: Start accepts. Automaton has 18028 states and 29059 transitions. Word has length 637 [2025-03-08 11:03:41,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:03:41,520 INFO L471 AbstractCegarLoop]: Abstraction has 18028 states and 29059 transitions. [2025-03-08 11:03:41,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) [2025-03-08 11:03:41,521 INFO L276 IsEmpty]: Start isEmpty. Operand 18028 states and 29059 transitions. [2025-03-08 11:03:41,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 639 [2025-03-08 11:03:41,528 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:03:41,529 INFO L218 NwaCegarLoop]: trace histogram [103, 103, 103, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:03:41,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 11:03:41,529 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:03:41,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:03:41,529 INFO L85 PathProgramCache]: Analyzing trace with hash 293737359, now seen corresponding path program 1 times [2025-03-08 11:03:41,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:03:41,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070347412] [2025-03-08 11:03:41,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:03:41,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:03:41,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 638 statements into 1 equivalence classes. [2025-03-08 11:03:41,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 638 of 638 statements. [2025-03-08 11:03:41,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:03:41,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:03:46,754 INFO L134 CoverageAnalysis]: Checked inductivity of 21012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21012 trivial. 0 not checked. [2025-03-08 11:03:46,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:03:46,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070347412] [2025-03-08 11:03:46,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070347412] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:03:46,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:03:46,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-03-08 11:03:46,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679415464] [2025-03-08 11:03:46,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:03:46,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-08 11:03:46,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:03:46,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-08 11:03:46,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2025-03-08 11:03:46,756 INFO L87 Difference]: Start difference. First operand 18028 states and 29059 transitions. Second operand has 18 states, 18 states have (on average 7.0) internal successors, (126), 18 states have internal predecessors, (126), 3 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 3 states have call predecessors, (103), 3 states have call successors, (103)