./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-48.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-48.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 4a9e9bf709714475d9b4c0874c912dec9c2ff0a074bd43dedf9b533a3abda5f5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 20:08:39,735 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 20:08:39,786 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 20:08:39,791 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 20:08:39,791 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 20:08:39,803 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 20:08:39,804 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 20:08:39,804 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 20:08:39,804 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 20:08:39,804 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 20:08:39,804 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 20:08:39,804 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 20:08:39,805 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 20:08:39,805 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 20:08:39,805 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 20:08:39,805 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 20:08:39,805 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 20:08:39,805 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 20:08:39,805 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 20:08:39,805 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 20:08:39,805 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 20:08:39,805 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 20:08:39,806 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 20:08:39,806 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 20:08:39,806 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 20:08:39,806 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 20:08:39,806 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 20:08:39,806 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 20:08:39,806 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 20:08:39,806 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 20:08:39,806 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 20:08:39,806 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 20:08:39,806 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:08:39,807 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 20:08:39,807 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 20:08:39,807 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 20:08:39,807 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 20:08:39,807 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 20:08:39,807 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 20:08:39,807 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 20:08:39,807 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 20:08:39,807 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 20:08:39,807 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 20:08:39,807 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 -> 4a9e9bf709714475d9b4c0874c912dec9c2ff0a074bd43dedf9b533a3abda5f5 [2025-03-03 20:08:40,005 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 20:08:40,011 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 20:08:40,013 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 20:08:40,014 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 20:08:40,014 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 20:08:40,014 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-48.i [2025-03-03 20:08:41,131 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e26fa987/6943de55053e45d8bcf82bb62f330055/FLAG5e8871323 [2025-03-03 20:08:41,405 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 20:08:41,406 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-48.i [2025-03-03 20:08:41,420 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e26fa987/6943de55053e45d8bcf82bb62f330055/FLAG5e8871323 [2025-03-03 20:08:41,705 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e26fa987/6943de55053e45d8bcf82bb62f330055 [2025-03-03 20:08:41,707 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 20:08:41,708 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 20:08:41,709 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 20:08:41,709 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 20:08:41,712 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 20:08:41,713 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:08:41" (1/1) ... [2025-03-03 20:08:41,713 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4caadb95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:08:41, skipping insertion in model container [2025-03-03 20:08:41,714 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:08:41" (1/1) ... [2025-03-03 20:08:41,736 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 20:08:41,840 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-48.i[916,929] [2025-03-03 20:08:41,990 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:08:42,005 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 20:08:42,015 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-48.i[916,929] [2025-03-03 20:08:42,113 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:08:42,133 INFO L204 MainTranslator]: Completed translation [2025-03-03 20:08:42,134 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:08:42 WrapperNode [2025-03-03 20:08:42,134 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 20:08:42,135 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 20:08:42,135 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 20:08:42,135 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 20:08:42,140 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:08:42" (1/1) ... [2025-03-03 20:08:42,160 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:08:42" (1/1) ... [2025-03-03 20:08:42,234 INFO L138 Inliner]: procedures = 26, calls = 123, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 864 [2025-03-03 20:08:42,235 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 20:08:42,235 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 20:08:42,235 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 20:08:42,235 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 20:08:42,243 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:08:42" (1/1) ... [2025-03-03 20:08:42,243 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:08:42" (1/1) ... [2025-03-03 20:08:42,264 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:08:42" (1/1) ... [2025-03-03 20:08:42,307 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-03 20:08:42,307 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:08:42" (1/1) ... [2025-03-03 20:08:42,307 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:08:42" (1/1) ... [2025-03-03 20:08:42,333 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:08:42" (1/1) ... [2025-03-03 20:08:42,339 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:08:42" (1/1) ... [2025-03-03 20:08:42,345 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:08:42" (1/1) ... [2025-03-03 20:08:42,350 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:08:42" (1/1) ... [2025-03-03 20:08:42,360 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 20:08:42,362 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 20:08:42,362 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 20:08:42,362 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 20:08:42,363 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:08:42" (1/1) ... [2025-03-03 20:08:42,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:08:42,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:08:42,390 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-03 20:08:42,393 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-03 20:08:42,410 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 20:08:42,411 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 20:08:42,411 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 20:08:42,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 20:08:42,411 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 20:08:42,411 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 20:08:42,535 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 20:08:42,536 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 20:08:43,914 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2025-03-03 20:08:43,914 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 20:08:43,948 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 20:08:43,948 INFO L336 CfgBuilder]: Removed 3 assume(true) statements. [2025-03-03 20:08:43,948 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:08:43 BoogieIcfgContainer [2025-03-03 20:08:43,948 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 20:08:43,950 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 20:08:43,951 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 20:08:43,954 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 20:08:43,954 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 08:08:41" (1/3) ... [2025-03-03 20:08:43,955 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73991c2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:08:43, skipping insertion in model container [2025-03-03 20:08:43,956 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:08:42" (2/3) ... [2025-03-03 20:08:43,956 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73991c2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:08:43, skipping insertion in model container [2025-03-03 20:08:43,956 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:08:43" (3/3) ... [2025-03-03 20:08:43,957 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-48.i [2025-03-03 20:08:43,967 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 20:08:43,970 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-48.i that has 2 procedures, 356 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 20:08:44,059 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 20:08:44,067 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;@6c0b959d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 20:08:44,067 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 20:08:44,071 INFO L276 IsEmpty]: Start isEmpty. Operand has 356 states, 243 states have (on average 1.5761316872427984) internal successors, (383), 244 states have internal predecessors, (383), 110 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 110 states have call predecessors, (110), 110 states have call successors, (110) [2025-03-03 20:08:44,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 705 [2025-03-03 20:08:44,097 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:08:44,099 INFO L218 NwaCegarLoop]: trace histogram [110, 110, 110, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:08:44,099 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:08:44,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:08:44,105 INFO L85 PathProgramCache]: Analyzing trace with hash -267570716, now seen corresponding path program 1 times [2025-03-03 20:08:44,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:08:44,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001823045] [2025-03-03 20:08:44,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:08:44,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:08:44,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 704 statements into 1 equivalence classes. [2025-03-03 20:08:44,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 704 of 704 statements. [2025-03-03 20:08:44,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:08:44,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:08:44,710 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 0 proven. 218 refuted. 0 times theorem prover too weak. 23762 trivial. 0 not checked. [2025-03-03 20:08:44,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:08:44,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001823045] [2025-03-03 20:08:44,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001823045] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:08:44,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [560436498] [2025-03-03 20:08:44,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:08:44,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:08:44,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:08:44,715 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-03 20:08:44,717 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-03 20:08:44,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 704 statements into 1 equivalence classes. [2025-03-03 20:08:45,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 704 of 704 statements. [2025-03-03 20:08:45,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:08:45,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:08:45,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 1588 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 20:08:45,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:08:45,145 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 218 proven. 0 refuted. 0 times theorem prover too weak. 23762 trivial. 0 not checked. [2025-03-03 20:08:45,145 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 20:08:45,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [560436498] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:08:45,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 20:08:45,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 20:08:45,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986234532] [2025-03-03 20:08:45,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:08:45,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 20:08:45,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:08:45,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 20:08:45,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 20:08:45,173 INFO L87 Difference]: Start difference. First operand has 356 states, 243 states have (on average 1.5761316872427984) internal successors, (383), 244 states have internal predecessors, (383), 110 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 110 states have call predecessors, (110), 110 states have call successors, (110) Second operand has 2 states, 2 states have (on average 79.5) internal successors, (159), 2 states have internal predecessors, (159), 2 states have call successors, (110), 2 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 2 states have call successors, (110) [2025-03-03 20:08:45,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:08:45,251 INFO L93 Difference]: Finished difference Result 705 states and 1309 transitions. [2025-03-03 20:08:45,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 20:08:45,253 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 79.5) internal successors, (159), 2 states have internal predecessors, (159), 2 states have call successors, (110), 2 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 2 states have call successors, (110) Word has length 704 [2025-03-03 20:08:45,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:08:45,260 INFO L225 Difference]: With dead ends: 705 [2025-03-03 20:08:45,260 INFO L226 Difference]: Without dead ends: 352 [2025-03-03 20:08:45,265 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 705 GetRequests, 705 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-03 20:08:45,266 INFO L435 NwaCegarLoop]: 576 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:08:45,267 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 576 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:08:45,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2025-03-03 20:08:45,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 352. [2025-03-03 20:08:45,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 240 states have (on average 1.5541666666666667) internal successors, (373), 240 states have internal predecessors, (373), 110 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 110 states have call predecessors, (110), 110 states have call successors, (110) [2025-03-03 20:08:45,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 593 transitions. [2025-03-03 20:08:45,330 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 593 transitions. Word has length 704 [2025-03-03 20:08:45,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:08:45,333 INFO L471 AbstractCegarLoop]: Abstraction has 352 states and 593 transitions. [2025-03-03 20:08:45,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 79.5) internal successors, (159), 2 states have internal predecessors, (159), 2 states have call successors, (110), 2 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 2 states have call successors, (110) [2025-03-03 20:08:45,333 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 593 transitions. [2025-03-03 20:08:45,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 705 [2025-03-03 20:08:45,348 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:08:45,349 INFO L218 NwaCegarLoop]: trace histogram [110, 110, 110, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:08:45,359 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-03 20:08:45,554 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-03 20:08:45,554 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:08:45,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:08:45,555 INFO L85 PathProgramCache]: Analyzing trace with hash 70186297, now seen corresponding path program 1 times [2025-03-03 20:08:45,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:08:45,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540165529] [2025-03-03 20:08:45,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:08:45,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:08:45,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 704 statements into 1 equivalence classes. [2025-03-03 20:08:45,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 704 of 704 statements. [2025-03-03 20:08:45,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:08:45,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:08:46,183 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23980 trivial. 0 not checked. [2025-03-03 20:08:46,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:08:46,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540165529] [2025-03-03 20:08:46,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540165529] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:08:46,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:08:46,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:08:46,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314872694] [2025-03-03 20:08:46,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:08:46,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:08:46,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:08:46,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:08:46,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:08:46,191 INFO L87 Difference]: Start difference. First operand 352 states and 593 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) [2025-03-03 20:08:46,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:08:46,321 INFO L93 Difference]: Finished difference Result 1039 states and 1754 transitions. [2025-03-03 20:08:46,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:08:46,325 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) Word has length 704 [2025-03-03 20:08:46,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:08:46,334 INFO L225 Difference]: With dead ends: 1039 [2025-03-03 20:08:46,336 INFO L226 Difference]: Without dead ends: 690 [2025-03-03 20:08:46,337 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-03 20:08:46,338 INFO L435 NwaCegarLoop]: 577 mSDtfsCounter, 558 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 558 SdHoareTripleChecker+Valid, 1133 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:08:46,338 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [558 Valid, 1133 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:08:46,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2025-03-03 20:08:46,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 688. [2025-03-03 20:08:46,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 688 states, 465 states have (on average 1.5483870967741935) internal successors, (720), 465 states have internal predecessors, (720), 220 states have call successors, (220), 2 states have call predecessors, (220), 2 states have return successors, (220), 220 states have call predecessors, (220), 220 states have call successors, (220) [2025-03-03 20:08:46,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 1160 transitions. [2025-03-03 20:08:46,449 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 1160 transitions. Word has length 704 [2025-03-03 20:08:46,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:08:46,450 INFO L471 AbstractCegarLoop]: Abstraction has 688 states and 1160 transitions. [2025-03-03 20:08:46,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) [2025-03-03 20:08:46,450 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 1160 transitions. [2025-03-03 20:08:46,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 705 [2025-03-03 20:08:46,463 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:08:46,463 INFO L218 NwaCegarLoop]: trace histogram [110, 110, 110, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:08:46,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 20:08:46,463 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:08:46,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:08:46,465 INFO L85 PathProgramCache]: Analyzing trace with hash -237725961, now seen corresponding path program 1 times [2025-03-03 20:08:46,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:08:46,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393802381] [2025-03-03 20:08:46,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:08:46,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:08:46,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 704 statements into 1 equivalence classes. [2025-03-03 20:08:46,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 704 of 704 statements. [2025-03-03 20:08:46,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:08:46,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:08:46,816 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23980 trivial. 0 not checked. [2025-03-03 20:08:46,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:08:46,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393802381] [2025-03-03 20:08:46,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393802381] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:08:46,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:08:46,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:08:46,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927339492] [2025-03-03 20:08:46,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:08:46,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:08:46,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:08:46,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:08:46,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:08:46,824 INFO L87 Difference]: Start difference. First operand 688 states and 1160 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) [2025-03-03 20:08:46,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:08:46,949 INFO L93 Difference]: Finished difference Result 1780 states and 3016 transitions. [2025-03-03 20:08:46,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:08:46,950 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) Word has length 704 [2025-03-03 20:08:46,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:08:46,959 INFO L225 Difference]: With dead ends: 1780 [2025-03-03 20:08:46,960 INFO L226 Difference]: Without dead ends: 1095 [2025-03-03 20:08:46,965 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-03 20:08:46,966 INFO L435 NwaCegarLoop]: 607 mSDtfsCounter, 358 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 1167 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:08:46,967 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 1167 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:08:46,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1095 states. [2025-03-03 20:08:47,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1095 to 1091. [2025-03-03 20:08:47,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1091 states, 792 states have (on average 1.5921717171717171) internal successors, (1261), 794 states have internal predecessors, (1261), 294 states have call successors, (294), 4 states have call predecessors, (294), 4 states have return successors, (294), 292 states have call predecessors, (294), 294 states have call successors, (294) [2025-03-03 20:08:47,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1091 states to 1091 states and 1849 transitions. [2025-03-03 20:08:47,062 INFO L78 Accepts]: Start accepts. Automaton has 1091 states and 1849 transitions. Word has length 704 [2025-03-03 20:08:47,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:08:47,064 INFO L471 AbstractCegarLoop]: Abstraction has 1091 states and 1849 transitions. [2025-03-03 20:08:47,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) [2025-03-03 20:08:47,065 INFO L276 IsEmpty]: Start isEmpty. Operand 1091 states and 1849 transitions. [2025-03-03 20:08:47,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 705 [2025-03-03 20:08:47,074 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:08:47,074 INFO L218 NwaCegarLoop]: trace histogram [110, 110, 110, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:08:47,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 20:08:47,074 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:08:47,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:08:47,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1550175737, now seen corresponding path program 1 times [2025-03-03 20:08:47,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:08:47,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524450477] [2025-03-03 20:08:47,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:08:47,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:08:47,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 704 statements into 1 equivalence classes. [2025-03-03 20:08:47,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 704 of 704 statements. [2025-03-03 20:08:47,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:08:47,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:08:47,340 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23980 trivial. 0 not checked. [2025-03-03 20:08:47,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:08:47,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524450477] [2025-03-03 20:08:47,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524450477] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:08:47,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:08:47,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:08:47,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092656788] [2025-03-03 20:08:47,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:08:47,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:08:47,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:08:47,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:08:47,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:08:47,344 INFO L87 Difference]: Start difference. First operand 1091 states and 1849 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) [2025-03-03 20:08:47,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:08:47,470 INFO L93 Difference]: Finished difference Result 2973 states and 5055 transitions. [2025-03-03 20:08:47,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:08:47,471 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) Word has length 704 [2025-03-03 20:08:47,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:08:47,486 INFO L225 Difference]: With dead ends: 2973 [2025-03-03 20:08:47,486 INFO L226 Difference]: Without dead ends: 1885 [2025-03-03 20:08:47,491 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-03 20:08:47,493 INFO L435 NwaCegarLoop]: 572 mSDtfsCounter, 341 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 1132 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:08:47,494 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 1132 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:08:47,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1885 states. [2025-03-03 20:08:47,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1885 to 1881. [2025-03-03 20:08:47,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1881 states, 1422 states have (on average 1.6146272855133614) internal successors, (2296), 1428 states have internal predecessors, (2296), 450 states have call successors, (450), 8 states have call predecessors, (450), 8 states have return successors, (450), 444 states have call predecessors, (450), 450 states have call successors, (450) [2025-03-03 20:08:47,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1881 states to 1881 states and 3196 transitions. [2025-03-03 20:08:47,613 INFO L78 Accepts]: Start accepts. Automaton has 1881 states and 3196 transitions. Word has length 704 [2025-03-03 20:08:47,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:08:47,614 INFO L471 AbstractCegarLoop]: Abstraction has 1881 states and 3196 transitions. [2025-03-03 20:08:47,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) [2025-03-03 20:08:47,615 INFO L276 IsEmpty]: Start isEmpty. Operand 1881 states and 3196 transitions. [2025-03-03 20:08:47,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 705 [2025-03-03 20:08:47,621 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:08:47,621 INFO L218 NwaCegarLoop]: trace histogram [110, 110, 110, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:08:47,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 20:08:47,621 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:08:47,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:08:47,622 INFO L85 PathProgramCache]: Analyzing trace with hash -380443368, now seen corresponding path program 1 times [2025-03-03 20:08:47,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:08:47,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840274092] [2025-03-03 20:08:47,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:08:47,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:08:47,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 704 statements into 1 equivalence classes. [2025-03-03 20:08:47,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 704 of 704 statements. [2025-03-03 20:08:47,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:08:47,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:08:47,882 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23980 trivial. 0 not checked. [2025-03-03 20:08:47,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:08:47,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840274092] [2025-03-03 20:08:47,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840274092] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:08:47,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:08:47,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:08:47,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600139270] [2025-03-03 20:08:47,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:08:47,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:08:47,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:08:47,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:08:47,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:08:47,885 INFO L87 Difference]: Start difference. First operand 1881 states and 3196 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) [2025-03-03 20:08:48,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:08:48,064 INFO L93 Difference]: Finished difference Result 5450 states and 9243 transitions. [2025-03-03 20:08:48,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:08:48,065 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) Word has length 704 [2025-03-03 20:08:48,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:08:48,087 INFO L225 Difference]: With dead ends: 5450 [2025-03-03 20:08:48,087 INFO L226 Difference]: Without dead ends: 3572 [2025-03-03 20:08:48,093 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-03 20:08:48,094 INFO L435 NwaCegarLoop]: 573 mSDtfsCounter, 548 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 1136 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:08:48,095 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [548 Valid, 1136 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:08:48,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3572 states. [2025-03-03 20:08:48,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3572 to 3562. [2025-03-03 20:08:48,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3562 states, 2645 states have (on average 1.5962192816635161) internal successors, (4222), 2657 states have internal predecessors, (4222), 900 states have call successors, (900), 16 states have call predecessors, (900), 16 states have return successors, (900), 888 states have call predecessors, (900), 900 states have call successors, (900) [2025-03-03 20:08:48,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3562 states to 3562 states and 6022 transitions. [2025-03-03 20:08:48,419 INFO L78 Accepts]: Start accepts. Automaton has 3562 states and 6022 transitions. Word has length 704 [2025-03-03 20:08:48,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:08:48,422 INFO L471 AbstractCegarLoop]: Abstraction has 3562 states and 6022 transitions. [2025-03-03 20:08:48,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) [2025-03-03 20:08:48,422 INFO L276 IsEmpty]: Start isEmpty. Operand 3562 states and 6022 transitions. [2025-03-03 20:08:48,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 705 [2025-03-03 20:08:48,430 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:08:48,431 INFO L218 NwaCegarLoop]: trace histogram [110, 110, 110, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:08:48,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 20:08:48,431 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:08:48,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:08:48,433 INFO L85 PathProgramCache]: Analyzing trace with hash 972866329, now seen corresponding path program 1 times [2025-03-03 20:08:48,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:08:48,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283798204] [2025-03-03 20:08:48,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:08:48,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:08:48,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 704 statements into 1 equivalence classes. [2025-03-03 20:08:48,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 704 of 704 statements. [2025-03-03 20:08:48,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:08:48,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:08:48,660 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23980 trivial. 0 not checked. [2025-03-03 20:08:48,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:08:48,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283798204] [2025-03-03 20:08:48,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283798204] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:08:48,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:08:48,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:08:48,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600375829] [2025-03-03 20:08:48,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:08:48,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:08:48,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:08:48,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:08:48,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:08:48,663 INFO L87 Difference]: Start difference. First operand 3562 states and 6022 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) [2025-03-03 20:08:48,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:08:48,824 INFO L93 Difference]: Finished difference Result 7379 states and 12442 transitions. [2025-03-03 20:08:48,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:08:48,825 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) Word has length 704 [2025-03-03 20:08:48,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:08:48,851 INFO L225 Difference]: With dead ends: 7379 [2025-03-03 20:08:48,851 INFO L226 Difference]: Without dead ends: 3820 [2025-03-03 20:08:48,862 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-03 20:08:48,863 INFO L435 NwaCegarLoop]: 575 mSDtfsCounter, 18 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 1141 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:08:48,864 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 1141 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:08:48,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3820 states. [2025-03-03 20:08:49,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3820 to 3674. [2025-03-03 20:08:49,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3674 states, 2757 states have (on average 1.5894087776568735) internal successors, (4382), 2769 states have internal predecessors, (4382), 900 states have call successors, (900), 16 states have call predecessors, (900), 16 states have return successors, (900), 888 states have call predecessors, (900), 900 states have call successors, (900) [2025-03-03 20:08:49,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3674 states to 3674 states and 6182 transitions. [2025-03-03 20:08:49,113 INFO L78 Accepts]: Start accepts. Automaton has 3674 states and 6182 transitions. Word has length 704 [2025-03-03 20:08:49,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:08:49,115 INFO L471 AbstractCegarLoop]: Abstraction has 3674 states and 6182 transitions. [2025-03-03 20:08:49,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) [2025-03-03 20:08:49,116 INFO L276 IsEmpty]: Start isEmpty. Operand 3674 states and 6182 transitions. [2025-03-03 20:08:49,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 705 [2025-03-03 20:08:49,123 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:08:49,123 INFO L218 NwaCegarLoop]: trace histogram [110, 110, 110, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:08:49,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 20:08:49,123 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:08:49,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:08:49,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1001495480, now seen corresponding path program 1 times [2025-03-03 20:08:49,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:08:49,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279131975] [2025-03-03 20:08:49,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:08:49,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:08:49,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 704 statements into 1 equivalence classes. [2025-03-03 20:08:49,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 704 of 704 statements. [2025-03-03 20:08:49,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:08:49,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:08:49,454 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23980 trivial. 0 not checked. [2025-03-03 20:08:49,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:08:49,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279131975] [2025-03-03 20:08:49,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279131975] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:08:49,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:08:49,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:08:49,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938461139] [2025-03-03 20:08:49,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:08:49,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:08:49,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:08:49,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:08:49,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:08:49,457 INFO L87 Difference]: Start difference. First operand 3674 states and 6182 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) [2025-03-03 20:08:49,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:08:49,719 INFO L93 Difference]: Finished difference Result 11016 states and 18540 transitions. [2025-03-03 20:08:49,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:08:49,720 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) Word has length 704 [2025-03-03 20:08:49,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:08:49,754 INFO L225 Difference]: With dead ends: 11016 [2025-03-03 20:08:49,754 INFO L226 Difference]: Without dead ends: 7345 [2025-03-03 20:08:49,764 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-03 20:08:49,765 INFO L435 NwaCegarLoop]: 573 mSDtfsCounter, 331 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 1140 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:08:49,765 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 1140 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:08:49,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7345 states. [2025-03-03 20:08:50,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7345 to 7343. [2025-03-03 20:08:50,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7343 states, 5510 states have (on average 1.5840290381125226) internal successors, (8728), 5534 states have internal predecessors, (8728), 1800 states have call successors, (1800), 32 states have call predecessors, (1800), 32 states have return successors, (1800), 1776 states have call predecessors, (1800), 1800 states have call successors, (1800) [2025-03-03 20:08:50,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7343 states to 7343 states and 12328 transitions. [2025-03-03 20:08:50,381 INFO L78 Accepts]: Start accepts. Automaton has 7343 states and 12328 transitions. Word has length 704 [2025-03-03 20:08:50,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:08:50,382 INFO L471 AbstractCegarLoop]: Abstraction has 7343 states and 12328 transitions. [2025-03-03 20:08:50,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) [2025-03-03 20:08:50,383 INFO L276 IsEmpty]: Start isEmpty. Operand 7343 states and 12328 transitions. [2025-03-03 20:08:50,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 706 [2025-03-03 20:08:50,389 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:08:50,389 INFO L218 NwaCegarLoop]: trace histogram [110, 110, 110, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:08:50,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 20:08:50,390 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:08:50,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:08:50,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1128490188, now seen corresponding path program 1 times [2025-03-03 20:08:50,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:08:50,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294999618] [2025-03-03 20:08:50,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:08:50,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:08:50,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 705 statements into 1 equivalence classes. [2025-03-03 20:08:50,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 705 of 705 statements. [2025-03-03 20:08:50,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:08:50,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:08:50,720 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23980 trivial. 0 not checked. [2025-03-03 20:08:50,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:08:50,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294999618] [2025-03-03 20:08:50,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294999618] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:08:50,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:08:50,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:08:50,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055993970] [2025-03-03 20:08:50,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:08:50,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:08:50,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:08:50,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:08:50,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:08:50,723 INFO L87 Difference]: Start difference. First operand 7343 states and 12328 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) [2025-03-03 20:08:51,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:08:51,155 INFO L93 Difference]: Finished difference Result 22023 states and 36978 transitions. [2025-03-03 20:08:51,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:08:51,157 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) Word has length 705 [2025-03-03 20:08:51,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:08:51,231 INFO L225 Difference]: With dead ends: 22023 [2025-03-03 20:08:51,231 INFO L226 Difference]: Without dead ends: 14683 [2025-03-03 20:08:51,260 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-03 20:08:51,260 INFO L435 NwaCegarLoop]: 714 mSDtfsCounter, 370 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 1277 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:08:51,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [370 Valid, 1277 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:08:51,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14683 states. [2025-03-03 20:08:52,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14683 to 14675. [2025-03-03 20:08:52,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14675 states, 11010 states have (on average 1.581653042688465) internal successors, (17414), 11058 states have internal predecessors, (17414), 3600 states have call successors, (3600), 64 states have call predecessors, (3600), 64 states have return successors, (3600), 3552 states have call predecessors, (3600), 3600 states have call successors, (3600) [2025-03-03 20:08:52,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14675 states to 14675 states and 24614 transitions. [2025-03-03 20:08:52,634 INFO L78 Accepts]: Start accepts. Automaton has 14675 states and 24614 transitions. Word has length 705 [2025-03-03 20:08:52,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:08:52,635 INFO L471 AbstractCegarLoop]: Abstraction has 14675 states and 24614 transitions. [2025-03-03 20:08:52,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) [2025-03-03 20:08:52,636 INFO L276 IsEmpty]: Start isEmpty. Operand 14675 states and 24614 transitions. [2025-03-03 20:08:52,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 706 [2025-03-03 20:08:52,650 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:08:52,650 INFO L218 NwaCegarLoop]: trace histogram [110, 110, 110, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:08:52,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 20:08:52,650 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:08:52,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:08:52,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1753402032, now seen corresponding path program 1 times [2025-03-03 20:08:52,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:08:52,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005243687] [2025-03-03 20:08:52,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:08:52,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:08:52,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 705 statements into 1 equivalence classes. [2025-03-03 20:08:52,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 705 of 705 statements. [2025-03-03 20:08:52,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:08:52,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:08:53,254 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23980 trivial. 0 not checked. [2025-03-03 20:08:53,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:08:53,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005243687] [2025-03-03 20:08:53,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005243687] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:08:53,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:08:53,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:08:53,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454079510] [2025-03-03 20:08:53,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:08:53,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:08:53,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:08:53,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:08:53,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:08:53,257 INFO L87 Difference]: Start difference. First operand 14675 states and 24614 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) [2025-03-03 20:08:54,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:08:54,102 INFO L93 Difference]: Finished difference Result 43891 states and 73580 transitions. [2025-03-03 20:08:54,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:08:54,103 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) Word has length 705 [2025-03-03 20:08:54,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:08:54,221 INFO L225 Difference]: With dead ends: 43891 [2025-03-03 20:08:54,222 INFO L226 Difference]: Without dead ends: 29219 [2025-03-03 20:08:54,281 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-03 20:08:54,282 INFO L435 NwaCegarLoop]: 574 mSDtfsCounter, 338 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 1142 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:08:54,283 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 1142 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:08:54,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29219 states. [2025-03-03 20:08:56,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29219 to 29217. [2025-03-03 20:08:56,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29217 states, 21888 states have (on average 1.5734649122807018) internal successors, (34440), 21984 states have internal predecessors, (34440), 7200 states have call successors, (7200), 128 states have call predecessors, (7200), 128 states have return successors, (7200), 7104 states have call predecessors, (7200), 7200 states have call successors, (7200) [2025-03-03 20:08:56,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29217 states to 29217 states and 48840 transitions. [2025-03-03 20:08:56,239 INFO L78 Accepts]: Start accepts. Automaton has 29217 states and 48840 transitions. Word has length 705 [2025-03-03 20:08:56,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:08:56,240 INFO L471 AbstractCegarLoop]: Abstraction has 29217 states and 48840 transitions. [2025-03-03 20:08:56,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) [2025-03-03 20:08:56,240 INFO L276 IsEmpty]: Start isEmpty. Operand 29217 states and 48840 transitions. [2025-03-03 20:08:56,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 706 [2025-03-03 20:08:56,260 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:08:56,261 INFO L218 NwaCegarLoop]: trace histogram [110, 110, 110, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:08:56,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 20:08:56,261 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:08:56,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:08:56,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1188255567, now seen corresponding path program 1 times [2025-03-03 20:08:56,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:08:56,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604947338] [2025-03-03 20:08:56,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:08:56,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:08:56,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 705 statements into 1 equivalence classes. [2025-03-03 20:08:56,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 705 of 705 statements. [2025-03-03 20:08:56,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:08:56,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:08:56,721 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23980 trivial. 0 not checked. [2025-03-03 20:08:56,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:08:56,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604947338] [2025-03-03 20:08:56,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604947338] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:08:56,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:08:56,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:08:56,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132912607] [2025-03-03 20:08:56,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:08:56,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:08:56,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:08:56,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:08:56,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:08:56,723 INFO L87 Difference]: Start difference. First operand 29217 states and 48840 transitions. Second operand has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) [2025-03-03 20:08:59,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:08:59,226 INFO L93 Difference]: Finished difference Result 110015 states and 183347 transitions. [2025-03-03 20:08:59,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 20:08:59,227 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) Word has length 705 [2025-03-03 20:08:59,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:08:59,597 INFO L225 Difference]: With dead ends: 110015 [2025-03-03 20:08:59,597 INFO L226 Difference]: Without dead ends: 80801 [2025-03-03 20:08:59,710 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-03 20:08:59,711 INFO L435 NwaCegarLoop]: 680 mSDtfsCounter, 751 mSDsluCounter, 903 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 751 SdHoareTripleChecker+Valid, 1583 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 20:08:59,711 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [751 Valid, 1583 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 20:08:59,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80801 states. [2025-03-03 20:09:05,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80801 to 80509. [2025-03-03 20:09:05,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80509 states, 59132 states have (on average 1.5533382939863356) internal successors, (91852), 59452 states have internal predecessors, (91852), 20992 states have call successors, (20992), 384 states have call predecessors, (20992), 384 states have return successors, (20992), 20672 states have call predecessors, (20992), 20992 states have call successors, (20992) [2025-03-03 20:09:06,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80509 states to 80509 states and 133836 transitions. [2025-03-03 20:09:06,363 INFO L78 Accepts]: Start accepts. Automaton has 80509 states and 133836 transitions. Word has length 705 [2025-03-03 20:09:06,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:09:06,364 INFO L471 AbstractCegarLoop]: Abstraction has 80509 states and 133836 transitions. [2025-03-03 20:09:06,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) [2025-03-03 20:09:06,365 INFO L276 IsEmpty]: Start isEmpty. Operand 80509 states and 133836 transitions. [2025-03-03 20:09:06,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 706 [2025-03-03 20:09:06,395 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:09:06,395 INFO L218 NwaCegarLoop]: trace histogram [110, 110, 110, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:09:06,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 20:09:06,395 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:09:06,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:09:06,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1405971250, now seen corresponding path program 1 times [2025-03-03 20:09:06,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:09:06,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041419333] [2025-03-03 20:09:06,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:09:06,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:09:06,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 705 statements into 1 equivalence classes. [2025-03-03 20:09:06,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 705 of 705 statements. [2025-03-03 20:09:06,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:09:06,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:09:07,315 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23980 trivial. 0 not checked. [2025-03-03 20:09:07,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:09:07,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041419333] [2025-03-03 20:09:07,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041419333] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:09:07,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:09:07,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 20:09:07,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134749311] [2025-03-03 20:09:07,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:09:07,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 20:09:07,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:09:07,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 20:09:07,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:09:07,317 INFO L87 Difference]: Start difference. First operand 80509 states and 133836 transitions. Second operand has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) [2025-03-03 20:09:16,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:09:16,776 INFO L93 Difference]: Finished difference Result 407369 states and 678114 transitions. [2025-03-03 20:09:16,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 20:09:16,777 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) Word has length 705 [2025-03-03 20:09:16,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:09:18,410 INFO L225 Difference]: With dead ends: 407369 [2025-03-03 20:09:18,410 INFO L226 Difference]: Without dead ends: 326863 [2025-03-03 20:09:18,676 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 20:09:18,677 INFO L435 NwaCegarLoop]: 636 mSDtfsCounter, 2656 mSDsluCounter, 2256 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 180 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2656 SdHoareTripleChecker+Valid, 2892 SdHoareTripleChecker+Invalid, 706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 180 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 20:09:18,677 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2656 Valid, 2892 Invalid, 706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [180 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 20:09:18,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326863 states.