./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-66.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-66.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 775c75957856271495b27a73901f39ce07b49c52661110df0349063090f0d97b --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 20:10:02,584 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 20:10:02,637 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 20:10:02,643 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 20:10:02,643 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 20:10:02,663 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 20:10:02,665 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 20:10:02,665 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 20:10:02,665 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 20:10:02,665 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 20:10:02,666 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 20:10:02,667 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 20:10:02,667 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 20:10:02,667 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 20:10:02,667 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 20:10:02,668 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 20:10:02,668 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 20:10:02,668 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 20:10:02,668 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 20:10:02,668 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 20:10:02,668 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 20:10:02,668 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 20:10:02,668 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 20:10:02,668 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 20:10:02,668 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 20:10:02,669 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 20:10:02,669 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 20:10:02,669 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 20:10:02,669 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 20:10:02,669 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 20:10:02,669 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 20:10:02,669 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 20:10:02,669 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:10:02,670 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 20:10:02,670 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 20:10:02,670 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 20:10:02,670 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 20:10:02,670 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 20:10:02,670 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 20:10:02,670 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 20:10:02,670 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 20:10:02,670 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 20:10:02,670 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 20:10:02,670 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 -> 775c75957856271495b27a73901f39ce07b49c52661110df0349063090f0d97b [2025-03-03 20:10:02,888 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 20:10:02,896 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 20:10:02,898 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 20:10:02,898 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 20:10:02,899 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 20:10:02,900 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-66.i [2025-03-03 20:10:04,025 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2253e252c/ef25274698134d47a9fede9fd5455db5/FLAGb1a9d4c95 [2025-03-03 20:10:04,254 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 20:10:04,255 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-66.i [2025-03-03 20:10:04,271 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2253e252c/ef25274698134d47a9fede9fd5455db5/FLAGb1a9d4c95 [2025-03-03 20:10:04,580 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2253e252c/ef25274698134d47a9fede9fd5455db5 [2025-03-03 20:10:04,582 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 20:10:04,584 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 20:10:04,585 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 20:10:04,585 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 20:10:04,588 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 20:10:04,589 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:10:04" (1/1) ... [2025-03-03 20:10:04,589 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@505067d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:04, skipping insertion in model container [2025-03-03 20:10:04,589 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:10:04" (1/1) ... [2025-03-03 20:10:04,621 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 20:10:04,731 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-66.i[916,929] [2025-03-03 20:10:04,897 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:10:04,911 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 20:10:04,920 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-66.i[916,929] [2025-03-03 20:10:04,988 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:10:05,003 INFO L204 MainTranslator]: Completed translation [2025-03-03 20:10:05,003 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:05 WrapperNode [2025-03-03 20:10:05,004 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 20:10:05,005 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 20:10:05,005 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 20:10:05,005 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 20:10:05,009 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:10:05" (1/1) ... [2025-03-03 20:10:05,023 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:10:05" (1/1) ... [2025-03-03 20:10:05,085 INFO L138 Inliner]: procedures = 26, calls = 123, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 791 [2025-03-03 20:10:05,086 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 20:10:05,086 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 20:10:05,086 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 20:10:05,086 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 20:10:05,094 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:05" (1/1) ... [2025-03-03 20:10:05,094 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:05" (1/1) ... [2025-03-03 20:10:05,101 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:05" (1/1) ... [2025-03-03 20:10:05,127 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:10:05,128 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:05" (1/1) ... [2025-03-03 20:10:05,128 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:05" (1/1) ... [2025-03-03 20:10:05,156 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:05" (1/1) ... [2025-03-03 20:10:05,161 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:05" (1/1) ... [2025-03-03 20:10:05,172 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:05" (1/1) ... [2025-03-03 20:10:05,177 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:05" (1/1) ... [2025-03-03 20:10:05,188 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 20:10:05,189 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 20:10:05,189 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 20:10:05,190 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 20:10:05,191 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:05" (1/1) ... [2025-03-03 20:10:05,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:10:05,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:10:05,220 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:10:05,224 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:10:05,244 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 20:10:05,245 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 20:10:05,245 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 20:10:05,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 20:10:05,245 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 20:10:05,245 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 20:10:05,357 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 20:10:05,358 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 20:10:06,427 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2025-03-03 20:10:06,428 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 20:10:06,454 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 20:10:06,456 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 20:10:06,457 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:10:06 BoogieIcfgContainer [2025-03-03 20:10:06,457 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 20:10:06,459 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 20:10:06,459 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 20:10:06,462 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 20:10:06,462 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 08:10:04" (1/3) ... [2025-03-03 20:10:06,463 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6da612fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:10:06, skipping insertion in model container [2025-03-03 20:10:06,463 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:05" (2/3) ... [2025-03-03 20:10:06,463 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6da612fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:10:06, skipping insertion in model container [2025-03-03 20:10:06,463 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:10:06" (3/3) ... [2025-03-03 20:10:06,464 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-66.i [2025-03-03 20:10:06,474 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 20:10:06,477 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-66.i that has 2 procedures, 331 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 20:10:06,532 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 20:10:06,540 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;@40582a2d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 20:10:06,540 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 20:10:06,546 INFO L276 IsEmpty]: Start isEmpty. Operand has 331 states, 218 states have (on average 1.5825688073394495) internal successors, (345), 219 states have internal predecessors, (345), 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:10:06,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 710 [2025-03-03 20:10:06,567 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:10:06,568 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, 1, 1, 1, 1] [2025-03-03 20:10:06,569 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:10:06,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:10:06,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1176208334, now seen corresponding path program 1 times [2025-03-03 20:10:06,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:10:06,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189051127] [2025-03-03 20:10:06,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:10:06,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:10:06,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 709 statements into 1 equivalence classes. [2025-03-03 20:10:06,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 709 of 709 statements. [2025-03-03 20:10:06,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:10:06,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:10:07,128 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:10:07,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:10:07,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189051127] [2025-03-03 20:10:07,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189051127] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:10:07,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1094612598] [2025-03-03 20:10:07,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:10:07,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:10:07,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:10:07,136 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:10:07,137 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:10:07,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 709 statements into 1 equivalence classes. [2025-03-03 20:10:07,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 709 of 709 statements. [2025-03-03 20:10:07,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:10:07,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:10:07,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 1629 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 20:10:07,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:10:07,610 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:10:07,611 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 20:10:07,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1094612598] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:10:07,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 20:10:07,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 20:10:07,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927149337] [2025-03-03 20:10:07,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:10:07,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 20:10:07,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:10:07,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 20:10:07,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 20:10:07,639 INFO L87 Difference]: Start difference. First operand has 331 states, 218 states have (on average 1.5825688073394495) internal successors, (345), 219 states have internal predecessors, (345), 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 82.0) internal successors, (164), 2 states have internal predecessors, (164), 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:10:07,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:10:07,709 INFO L93 Difference]: Finished difference Result 651 states and 1227 transitions. [2025-03-03 20:10:07,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 20:10:07,711 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 82.0) internal successors, (164), 2 states have internal predecessors, (164), 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 709 [2025-03-03 20:10:07,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:10:07,719 INFO L225 Difference]: With dead ends: 651 [2025-03-03 20:10:07,720 INFO L226 Difference]: Without dead ends: 323 [2025-03-03 20:10:07,726 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 710 GetRequests, 710 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:10:07,729 INFO L435 NwaCegarLoop]: 544 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:10:07,730 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 544 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:10:07,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2025-03-03 20:10:07,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 323. [2025-03-03 20:10:07,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 211 states have (on average 1.5687203791469195) internal successors, (331), 211 states have internal predecessors, (331), 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:10:07,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 551 transitions. [2025-03-03 20:10:07,801 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 551 transitions. Word has length 709 [2025-03-03 20:10:07,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:10:07,802 INFO L471 AbstractCegarLoop]: Abstraction has 323 states and 551 transitions. [2025-03-03 20:10:07,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 82.0) internal successors, (164), 2 states have internal predecessors, (164), 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:10:07,804 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 551 transitions. [2025-03-03 20:10:07,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 710 [2025-03-03 20:10:07,819 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:10:07,820 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, 1, 1, 1, 1] [2025-03-03 20:10:07,828 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 20:10:08,020 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:10:08,021 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:10:08,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:10:08,022 INFO L85 PathProgramCache]: Analyzing trace with hash -2090946286, now seen corresponding path program 1 times [2025-03-03 20:10:08,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:10:08,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107598277] [2025-03-03 20:10:08,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:10:08,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:10:08,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 709 statements into 1 equivalence classes. [2025-03-03 20:10:08,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 709 of 709 statements. [2025-03-03 20:10:08,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:10:08,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:10:08,738 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:10:08,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:10:08,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107598277] [2025-03-03 20:10:08,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107598277] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:10:08,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:10:08,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:10:08,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118913764] [2025-03-03 20:10:08,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:10:08,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:10:08,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:10:08,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:10:08,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:10:08,746 INFO L87 Difference]: Start difference. First operand 323 states and 551 transitions. Second operand has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 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:10:08,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:10:08,843 INFO L93 Difference]: Finished difference Result 836 states and 1431 transitions. [2025-03-03 20:10:08,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:10:08,844 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 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 709 [2025-03-03 20:10:08,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:10:08,852 INFO L225 Difference]: With dead ends: 836 [2025-03-03 20:10:08,852 INFO L226 Difference]: Without dead ends: 516 [2025-03-03 20:10:08,853 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:10:08,853 INFO L435 NwaCegarLoop]: 576 mSDtfsCounter, 315 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 1099 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:10:08,854 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 1099 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:10:08,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2025-03-03 20:10:08,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 513. [2025-03-03 20:10:08,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 513 states, 357 states have (on average 1.5994397759103642) internal successors, (571), 358 states have internal predecessors, (571), 153 states have call successors, (153), 2 states have call predecessors, (153), 2 states have return successors, (153), 152 states have call predecessors, (153), 153 states have call successors, (153) [2025-03-03 20:10:08,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 877 transitions. [2025-03-03 20:10:08,903 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 877 transitions. Word has length 709 [2025-03-03 20:10:08,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:10:08,904 INFO L471 AbstractCegarLoop]: Abstraction has 513 states and 877 transitions. [2025-03-03 20:10:08,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 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:10:08,905 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 877 transitions. [2025-03-03 20:10:08,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 711 [2025-03-03 20:10:08,926 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:10:08,926 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, 1, 1, 1, 1, 1] [2025-03-03 20:10:08,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 20:10:08,926 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:10:08,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:10:08,927 INFO L85 PathProgramCache]: Analyzing trace with hash -982954335, now seen corresponding path program 1 times [2025-03-03 20:10:08,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:10:08,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37669604] [2025-03-03 20:10:08,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:10:08,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:10:08,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 710 statements into 1 equivalence classes. [2025-03-03 20:10:09,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 710 of 710 statements. [2025-03-03 20:10:09,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:10:09,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:10:09,235 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:10:09,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:10:09,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37669604] [2025-03-03 20:10:09,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37669604] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:10:09,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:10:09,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:10:09,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712795330] [2025-03-03 20:10:09,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:10:09,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:10:09,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:10:09,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:10:09,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:10:09,240 INFO L87 Difference]: Start difference. First operand 513 states and 877 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 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:10:09,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:10:09,335 INFO L93 Difference]: Finished difference Result 1353 states and 2329 transitions. [2025-03-03 20:10:09,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:10:09,335 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 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 710 [2025-03-03 20:10:09,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:10:09,348 INFO L225 Difference]: With dead ends: 1353 [2025-03-03 20:10:09,348 INFO L226 Difference]: Without dead ends: 843 [2025-03-03 20:10:09,351 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:10:09,353 INFO L435 NwaCegarLoop]: 592 mSDtfsCounter, 245 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 1117 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:10:09,353 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 1117 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:10:09,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2025-03-03 20:10:09,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 839. [2025-03-03 20:10:09,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 839 states, 641 states have (on average 1.6458658346333854) internal successors, (1055), 644 states have internal predecessors, (1055), 193 states have call successors, (193), 4 states have call predecessors, (193), 4 states have return successors, (193), 190 states have call predecessors, (193), 193 states have call successors, (193) [2025-03-03 20:10:09,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 1441 transitions. [2025-03-03 20:10:09,419 INFO L78 Accepts]: Start accepts. Automaton has 839 states and 1441 transitions. Word has length 710 [2025-03-03 20:10:09,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:10:09,420 INFO L471 AbstractCegarLoop]: Abstraction has 839 states and 1441 transitions. [2025-03-03 20:10:09,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 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:10:09,421 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 1441 transitions. [2025-03-03 20:10:09,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 711 [2025-03-03 20:10:09,427 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:10:09,427 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, 1, 1, 1, 1, 1] [2025-03-03 20:10:09,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 20:10:09,427 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:10:09,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:10:09,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1301909120, now seen corresponding path program 1 times [2025-03-03 20:10:09,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:10:09,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599995876] [2025-03-03 20:10:09,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:10:09,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:10:09,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 710 statements into 1 equivalence classes. [2025-03-03 20:10:09,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 710 of 710 statements. [2025-03-03 20:10:09,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:10:09,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:10:10,149 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:10:10,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:10:10,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599995876] [2025-03-03 20:10:10,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599995876] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:10:10,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:10:10,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 20:10:10,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314764496] [2025-03-03 20:10:10,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:10:10,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 20:10:10,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:10:10,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 20:10:10,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:10:10,154 INFO L87 Difference]: Start difference. First operand 839 states and 1441 transitions. Second operand has 5 states, 5 states have (on average 32.6) internal successors, (163), 5 states have internal predecessors, (163), 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:10:10,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:10:10,798 INFO L93 Difference]: Finished difference Result 2842 states and 4877 transitions. [2025-03-03 20:10:10,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 20:10:10,799 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.6) internal successors, (163), 5 states have internal predecessors, (163), 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 710 [2025-03-03 20:10:10,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:10:10,811 INFO L225 Difference]: With dead ends: 2842 [2025-03-03 20:10:10,812 INFO L226 Difference]: Without dead ends: 2006 [2025-03-03 20:10:10,815 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 20:10:10,816 INFO L435 NwaCegarLoop]: 968 mSDtfsCounter, 1702 mSDsluCounter, 1919 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1702 SdHoareTripleChecker+Valid, 2887 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 20:10:10,816 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1702 Valid, 2887 Invalid, 473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 20:10:10,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2006 states. [2025-03-03 20:10:10,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2006 to 1673. [2025-03-03 20:10:10,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1673 states, 1278 states have (on average 1.6416275430359937) internal successors, (2098), 1284 states have internal predecessors, (2098), 386 states have call successors, (386), 8 states have call predecessors, (386), 8 states have return successors, (386), 380 states have call predecessors, (386), 386 states have call successors, (386) [2025-03-03 20:10:10,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1673 states to 1673 states and 2870 transitions. [2025-03-03 20:10:10,960 INFO L78 Accepts]: Start accepts. Automaton has 1673 states and 2870 transitions. Word has length 710 [2025-03-03 20:10:10,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:10:10,962 INFO L471 AbstractCegarLoop]: Abstraction has 1673 states and 2870 transitions. [2025-03-03 20:10:10,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.6) internal successors, (163), 5 states have internal predecessors, (163), 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:10:10,963 INFO L276 IsEmpty]: Start isEmpty. Operand 1673 states and 2870 transitions. [2025-03-03 20:10:10,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 711 [2025-03-03 20:10:10,969 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:10:10,969 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, 1, 1, 1, 1, 1] [2025-03-03 20:10:10,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 20:10:10,970 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:10:10,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:10:10,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1824861921, now seen corresponding path program 1 times [2025-03-03 20:10:10,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:10:10,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615429979] [2025-03-03 20:10:10,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:10:10,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:10:11,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 710 statements into 1 equivalence classes. [2025-03-03 20:10:11,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 710 of 710 statements. [2025-03-03 20:10:11,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:10:11,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:10:12,773 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:10:12,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:10:12,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615429979] [2025-03-03 20:10:12,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615429979] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:10:12,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:10:12,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 20:10:12,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678779573] [2025-03-03 20:10:12,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:10:12,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 20:10:12,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:10:12,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 20:10:12,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 20:10:12,775 INFO L87 Difference]: Start difference. First operand 1673 states and 2870 transitions. Second operand has 6 states, 6 states have (on average 27.166666666666668) internal successors, (163), 6 states have internal predecessors, (163), 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:10:13,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:10:13,563 INFO L93 Difference]: Finished difference Result 6053 states and 10376 transitions. [2025-03-03 20:10:13,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 20:10:13,564 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.166666666666668) internal successors, (163), 6 states have internal predecessors, (163), 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 710 [2025-03-03 20:10:13,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:10:13,588 INFO L225 Difference]: With dead ends: 6053 [2025-03-03 20:10:13,589 INFO L226 Difference]: Without dead ends: 4383 [2025-03-03 20:10:13,593 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-03-03 20:10:13,594 INFO L435 NwaCegarLoop]: 614 mSDtfsCounter, 1132 mSDsluCounter, 1876 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1132 SdHoareTripleChecker+Valid, 2490 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 20:10:13,595 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1132 Valid, 2490 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 20:10:13,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4383 states. [2025-03-03 20:10:13,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4383 to 1890. [2025-03-03 20:10:13,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1890 states, 1456 states have (on average 1.6428571428571428) internal successors, (2392), 1463 states have internal predecessors, (2392), 421 states have call successors, (421), 12 states have call predecessors, (421), 12 states have return successors, (421), 414 states have call predecessors, (421), 421 states have call successors, (421) [2025-03-03 20:10:13,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1890 states to 1890 states and 3234 transitions. [2025-03-03 20:10:13,845 INFO L78 Accepts]: Start accepts. Automaton has 1890 states and 3234 transitions. Word has length 710 [2025-03-03 20:10:13,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:10:13,846 INFO L471 AbstractCegarLoop]: Abstraction has 1890 states and 3234 transitions. [2025-03-03 20:10:13,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.166666666666668) internal successors, (163), 6 states have internal predecessors, (163), 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:10:13,847 INFO L276 IsEmpty]: Start isEmpty. Operand 1890 states and 3234 transitions. [2025-03-03 20:10:13,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 711 [2025-03-03 20:10:13,858 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:10:13,859 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, 1, 1, 1, 1, 1] [2025-03-03 20:10:13,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 20:10:13,859 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:10:13,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:10:13,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1723949954, now seen corresponding path program 1 times [2025-03-03 20:10:13,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:10:13,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827370916] [2025-03-03 20:10:13,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:10:13,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:10:13,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 710 statements into 1 equivalence classes. [2025-03-03 20:10:14,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 710 of 710 statements. [2025-03-03 20:10:14,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:10:14,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:10:14,728 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:10:14,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:10:14,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827370916] [2025-03-03 20:10:14,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827370916] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:10:14,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:10:14,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:10:14,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35823405] [2025-03-03 20:10:14,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:10:14,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:10:14,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:10:14,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:10:14,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:10:14,732 INFO L87 Difference]: Start difference. First operand 1890 states and 3234 transitions. Second operand has 4 states, 4 states have (on average 40.75) internal successors, (163), 4 states have internal predecessors, (163), 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:10:15,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:10:15,226 INFO L93 Difference]: Finished difference Result 6214 states and 10657 transitions. [2025-03-03 20:10:15,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 20:10:15,227 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.75) internal successors, (163), 4 states have internal predecessors, (163), 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 710 [2025-03-03 20:10:15,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:10:15,247 INFO L225 Difference]: With dead ends: 6214 [2025-03-03 20:10:15,247 INFO L226 Difference]: Without dead ends: 4384 [2025-03-03 20:10:15,253 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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:10:15,254 INFO L435 NwaCegarLoop]: 624 mSDtfsCounter, 655 mSDsluCounter, 912 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 655 SdHoareTripleChecker+Valid, 1536 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 20:10:15,254 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [655 Valid, 1536 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 20:10:15,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4384 states. [2025-03-03 20:10:15,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4384 to 3539. [2025-03-03 20:10:15,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3539 states, 3039 states have (on average 1.6975978940440934) internal successors, (5159), 3048 states have internal predecessors, (5159), 484 states have call successors, (484), 15 states have call predecessors, (484), 15 states have return successors, (484), 475 states have call predecessors, (484), 484 states have call successors, (484) [2025-03-03 20:10:15,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3539 states to 3539 states and 6127 transitions. [2025-03-03 20:10:15,467 INFO L78 Accepts]: Start accepts. Automaton has 3539 states and 6127 transitions. Word has length 710 [2025-03-03 20:10:15,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:10:15,468 INFO L471 AbstractCegarLoop]: Abstraction has 3539 states and 6127 transitions. [2025-03-03 20:10:15,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.75) internal successors, (163), 4 states have internal predecessors, (163), 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:10:15,469 INFO L276 IsEmpty]: Start isEmpty. Operand 3539 states and 6127 transitions. [2025-03-03 20:10:15,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 711 [2025-03-03 20:10:15,475 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:10:15,476 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, 1, 1, 1, 1, 1] [2025-03-03 20:10:15,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 20:10:15,476 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:10:15,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:10:15,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1686373505, now seen corresponding path program 1 times [2025-03-03 20:10:15,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:10:15,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099261958] [2025-03-03 20:10:15,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:10:15,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:10:15,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 710 statements into 1 equivalence classes. [2025-03-03 20:10:15,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 710 of 710 statements. [2025-03-03 20:10:15,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:10:15,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:10:16,137 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:10:16,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:10:16,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099261958] [2025-03-03 20:10:16,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099261958] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:10:16,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:10:16,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:10:16,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904773508] [2025-03-03 20:10:16,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:10:16,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:10:16,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:10:16,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:10:16,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:10:16,140 INFO L87 Difference]: Start difference. First operand 3539 states and 6127 transitions. Second operand has 4 states, 4 states have (on average 40.75) internal successors, (163), 4 states have internal predecessors, (163), 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:10:16,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:10:16,691 INFO L93 Difference]: Finished difference Result 11131 states and 19155 transitions. [2025-03-03 20:10:16,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 20:10:16,692 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.75) internal successors, (163), 4 states have internal predecessors, (163), 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 710 [2025-03-03 20:10:16,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:10:16,731 INFO L225 Difference]: With dead ends: 11131 [2025-03-03 20:10:16,731 INFO L226 Difference]: Without dead ends: 7652 [2025-03-03 20:10:16,742 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:10:16,743 INFO L435 NwaCegarLoop]: 1100 mSDtfsCounter, 1054 mSDsluCounter, 1601 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1054 SdHoareTripleChecker+Valid, 2701 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 20:10:16,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1054 Valid, 2701 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 20:10:16,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7652 states. [2025-03-03 20:10:16,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7652 to 3607. [2025-03-03 20:10:16,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3607 states, 3107 states have (on average 1.6913421306726746) internal successors, (5255), 3116 states have internal predecessors, (5255), 484 states have call successors, (484), 15 states have call predecessors, (484), 15 states have return successors, (484), 475 states have call predecessors, (484), 484 states have call successors, (484) [2025-03-03 20:10:16,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3607 states to 3607 states and 6223 transitions. [2025-03-03 20:10:16,997 INFO L78 Accepts]: Start accepts. Automaton has 3607 states and 6223 transitions. Word has length 710 [2025-03-03 20:10:16,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:10:16,998 INFO L471 AbstractCegarLoop]: Abstraction has 3607 states and 6223 transitions. [2025-03-03 20:10:16,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.75) internal successors, (163), 4 states have internal predecessors, (163), 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:10:16,998 INFO L276 IsEmpty]: Start isEmpty. Operand 3607 states and 6223 transitions. [2025-03-03 20:10:17,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 711 [2025-03-03 20:10:17,005 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:10:17,005 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, 1, 1, 1, 1, 1] [2025-03-03 20:10:17,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 20:10:17,006 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:10:17,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:10:17,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1611521438, now seen corresponding path program 1 times [2025-03-03 20:10:17,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:10:17,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588785131] [2025-03-03 20:10:17,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:10:17,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:10:17,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 710 statements into 1 equivalence classes. [2025-03-03 20:10:17,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 710 of 710 statements. [2025-03-03 20:10:17,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:10:17,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:10:36,748 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:10:36,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:10:36,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588785131] [2025-03-03 20:10:36,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588785131] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:10:36,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:10:36,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-03 20:10:36,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776097959] [2025-03-03 20:10:36,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:10:36,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-03 20:10:36,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:10:36,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-03 20:10:36,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2025-03-03 20:10:36,751 INFO L87 Difference]: Start difference. First operand 3607 states and 6223 transitions. Second operand has 15 states, 15 states have (on average 10.866666666666667) internal successors, (163), 15 states have internal predecessors, (163), 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:10:38,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:10:38,074 INFO L93 Difference]: Finished difference Result 8174 states and 13836 transitions. [2025-03-03 20:10:38,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 20:10:38,077 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 10.866666666666667) internal successors, (163), 15 states have internal predecessors, (163), 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 710 [2025-03-03 20:10:38,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:10:38,105 INFO L225 Difference]: With dead ends: 8174 [2025-03-03 20:10:38,109 INFO L226 Difference]: Without dead ends: 4627 [2025-03-03 20:10:38,119 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2025-03-03 20:10:38,119 INFO L435 NwaCegarLoop]: 530 mSDtfsCounter, 168 mSDsluCounter, 2657 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 3187 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 20:10:38,120 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 3187 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 447 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 20:10:38,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4627 states. [2025-03-03 20:10:38,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4627 to 4067. [2025-03-03 20:10:38,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4067 states, 3517 states have (on average 1.661927779357407) internal successors, (5845), 3536 states have internal predecessors, (5845), 524 states have call successors, (524), 25 states have call predecessors, (524), 25 states have return successors, (524), 505 states have call predecessors, (524), 524 states have call successors, (524) [2025-03-03 20:10:38,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4067 states to 4067 states and 6893 transitions. [2025-03-03 20:10:38,335 INFO L78 Accepts]: Start accepts. Automaton has 4067 states and 6893 transitions. Word has length 710 [2025-03-03 20:10:38,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:10:38,336 INFO L471 AbstractCegarLoop]: Abstraction has 4067 states and 6893 transitions. [2025-03-03 20:10:38,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 10.866666666666667) internal successors, (163), 15 states have internal predecessors, (163), 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:10:38,337 INFO L276 IsEmpty]: Start isEmpty. Operand 4067 states and 6893 transitions. [2025-03-03 20:10:38,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 711 [2025-03-03 20:10:38,344 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:10:38,344 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, 1, 1, 1, 1, 1] [2025-03-03 20:10:38,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 20:10:38,344 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:10:38,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:10:38,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1612444959, now seen corresponding path program 1 times [2025-03-03 20:10:38,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:10:38,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108301536] [2025-03-03 20:10:38,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:10:38,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:10:38,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 710 statements into 1 equivalence classes. [2025-03-03 20:10:38,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 710 of 710 statements. [2025-03-03 20:10:38,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:10:38,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:11:01,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:11:01,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:11:01,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108301536] [2025-03-03 20:11:01,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108301536] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:11:01,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:11:01,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-03 20:11:01,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877513206] [2025-03-03 20:11:01,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:11:01,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-03 20:11:01,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:11:01,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-03 20:11:01,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2025-03-03 20:11:01,667 INFO L87 Difference]: Start difference. First operand 4067 states and 6893 transitions. Second operand has 16 states, 16 states have (on average 10.1875) internal successors, (163), 16 states have internal predecessors, (163), 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:11:02,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:11:02,799 INFO L93 Difference]: Finished difference Result 4597 states and 7598 transitions. [2025-03-03 20:11:02,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 20:11:02,800 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 10.1875) internal successors, (163), 16 states have internal predecessors, (163), 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 710 [2025-03-03 20:11:02,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:11:02,812 INFO L225 Difference]: With dead ends: 4597 [2025-03-03 20:11:02,812 INFO L226 Difference]: Without dead ends: 4595 [2025-03-03 20:11:02,813 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2025-03-03 20:11:02,814 INFO L435 NwaCegarLoop]: 530 mSDtfsCounter, 189 mSDsluCounter, 3620 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 4150 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 20:11:02,814 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 4150 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 20:11:02,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4595 states. [2025-03-03 20:11:02,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4595 to 4067. [2025-03-03 20:11:02,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4067 states, 3517 states have (on average 1.661927779357407) internal successors, (5845), 3536 states have internal predecessors, (5845), 524 states have call successors, (524), 25 states have call predecessors, (524), 25 states have return successors, (524), 505 states have call predecessors, (524), 524 states have call successors, (524) [2025-03-03 20:11:03,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4067 states to 4067 states and 6893 transitions. [2025-03-03 20:11:03,010 INFO L78 Accepts]: Start accepts. Automaton has 4067 states and 6893 transitions. Word has length 710 [2025-03-03 20:11:03,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:11:03,013 INFO L471 AbstractCegarLoop]: Abstraction has 4067 states and 6893 transitions. [2025-03-03 20:11:03,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 10.1875) internal successors, (163), 16 states have internal predecessors, (163), 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:11:03,014 INFO L276 IsEmpty]: Start isEmpty. Operand 4067 states and 6893 transitions. [2025-03-03 20:11:03,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 711 [2025-03-03 20:11:03,021 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:11:03,022 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, 1, 1, 1, 1, 1] [2025-03-03 20:11:03,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 20:11:03,022 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:11:03,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:11:03,023 INFO L85 PathProgramCache]: Analyzing trace with hash -195933025, now seen corresponding path program 1 times [2025-03-03 20:11:03,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:11:03,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607415209] [2025-03-03 20:11:03,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:11:03,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:11:03,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 710 statements into 1 equivalence classes. [2025-03-03 20:11:03,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 710 of 710 statements. [2025-03-03 20:11:03,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:11:03,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:11:21,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:11:21,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:11:21,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607415209] [2025-03-03 20:11:21,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607415209] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:11:21,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:11:21,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-03 20:11:21,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352192687] [2025-03-03 20:11:21,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:11:21,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-03 20:11:21,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:11:21,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-03 20:11:21,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2025-03-03 20:11:21,186 INFO L87 Difference]: Start difference. First operand 4067 states and 6893 transitions. Second operand has 15 states, 15 states have (on average 10.866666666666667) internal successors, (163), 15 states have internal predecessors, (163), 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:11:22,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:11:22,125 INFO L93 Difference]: Finished difference Result 4627 states and 7628 transitions. [2025-03-03 20:11:22,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 20:11:22,126 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 10.866666666666667) internal successors, (163), 15 states have internal predecessors, (163), 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 710 [2025-03-03 20:11:22,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:11:22,140 INFO L225 Difference]: With dead ends: 4627 [2025-03-03 20:11:22,140 INFO L226 Difference]: Without dead ends: 4625 [2025-03-03 20:11:22,142 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2025-03-03 20:11:22,142 INFO L435 NwaCegarLoop]: 535 mSDtfsCounter, 200 mSDsluCounter, 2169 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 2704 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 20:11:22,143 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 2704 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 20:11:22,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4625 states. [2025-03-03 20:11:22,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4625 to 4117. [2025-03-03 20:11:22,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4117 states, 3567 states have (on average 1.6582562377347911) internal successors, (5915), 3586 states have internal predecessors, (5915), 524 states have call successors, (524), 25 states have call predecessors, (524), 25 states have return successors, (524), 505 states have call predecessors, (524), 524 states have call successors, (524) [2025-03-03 20:11:22,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4117 states to 4117 states and 6963 transitions. [2025-03-03 20:11:22,368 INFO L78 Accepts]: Start accepts. Automaton has 4117 states and 6963 transitions. Word has length 710 [2025-03-03 20:11:22,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:11:22,369 INFO L471 AbstractCegarLoop]: Abstraction has 4117 states and 6963 transitions. [2025-03-03 20:11:22,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 10.866666666666667) internal successors, (163), 15 states have internal predecessors, (163), 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:11:22,369 INFO L276 IsEmpty]: Start isEmpty. Operand 4117 states and 6963 transitions. [2025-03-03 20:11:22,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 711 [2025-03-03 20:11:22,376 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:11:22,376 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, 1, 1, 1, 1, 1] [2025-03-03 20:11:22,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 20:11:22,377 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:11:22,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:11:22,378 INFO L85 PathProgramCache]: Analyzing trace with hash -195009504, now seen corresponding path program 1 times [2025-03-03 20:11:22,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:11:22,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234075231] [2025-03-03 20:11:22,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:11:22,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:11:22,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 710 statements into 1 equivalence classes. [2025-03-03 20:11:22,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 710 of 710 statements. [2025-03-03 20:11:22,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:11:22,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat