./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-86.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-86.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 37de0228bdc926eeed8c36d9a0d9df874217b43056bdb710b9397461ea004e55 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 02:03:02,236 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 02:03:02,301 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 02:03:02,306 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 02:03:02,306 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 02:03:02,321 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 02:03:02,322 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 02:03:02,323 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 02:03:02,323 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 02:03:02,323 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 02:03:02,323 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 02:03:02,323 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 02:03:02,324 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 02:03:02,324 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 02:03:02,324 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 02:03:02,324 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 02:03:02,325 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 02:03:02,325 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 02:03:02,325 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 02:03:02,325 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 02:03:02,326 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 02:03:02,326 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 02:03:02,326 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 02:03:02,326 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 02:03:02,326 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 02:03:02,326 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 02:03:02,326 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 02:03:02,326 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 02:03:02,326 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 02:03:02,326 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 02:03:02,326 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 02:03:02,326 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 02:03:02,326 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 02:03:02,327 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 02:03:02,327 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 02:03:02,327 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 02:03:02,327 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 02:03:02,327 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 02:03:02,327 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 02:03:02,327 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 02:03:02,327 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 02:03:02,327 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 02:03:02,327 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 02:03:02,327 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 -> 37de0228bdc926eeed8c36d9a0d9df874217b43056bdb710b9397461ea004e55 [2025-03-17 02:03:02,568 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 02:03:02,573 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 02:03:02,575 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 02:03:02,576 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 02:03:02,576 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 02:03:02,577 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-86.i [2025-03-17 02:03:03,719 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b4b84a25/83f2af6d699d43558d4f41c1b25e4c5e/FLAGa0b115e3e [2025-03-17 02:03:03,955 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 02:03:03,956 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-86.i [2025-03-17 02:03:03,963 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b4b84a25/83f2af6d699d43558d4f41c1b25e4c5e/FLAGa0b115e3e [2025-03-17 02:03:04,293 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b4b84a25/83f2af6d699d43558d4f41c1b25e4c5e [2025-03-17 02:03:04,295 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 02:03:04,297 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 02:03:04,298 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 02:03:04,298 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 02:03:04,302 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 02:03:04,302 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:03:04" (1/1) ... [2025-03-17 02:03:04,303 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65f93a33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:03:04, skipping insertion in model container [2025-03-17 02:03:04,303 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:03:04" (1/1) ... [2025-03-17 02:03:04,318 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 02:03:04,424 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_fillercodestructure_filler-ps-ci_file-86.i[919,932] [2025-03-17 02:03:04,493 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 02:03:04,511 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 02:03:04,519 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_fillercodestructure_filler-ps-ci_file-86.i[919,932] [2025-03-17 02:03:04,560 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 02:03:04,572 INFO L204 MainTranslator]: Completed translation [2025-03-17 02:03:04,573 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:03:04 WrapperNode [2025-03-17 02:03:04,574 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 02:03:04,575 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 02:03:04,575 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 02:03:04,575 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 02:03:04,580 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:03:04" (1/1) ... [2025-03-17 02:03:04,591 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:03:04" (1/1) ... [2025-03-17 02:03:04,638 INFO L138 Inliner]: procedures = 26, calls = 40, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 233 [2025-03-17 02:03:04,638 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 02:03:04,638 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 02:03:04,638 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 02:03:04,638 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 02:03:04,648 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:03:04" (1/1) ... [2025-03-17 02:03:04,648 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:03:04" (1/1) ... [2025-03-17 02:03:04,651 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:03:04" (1/1) ... [2025-03-17 02:03:04,672 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 02:03:04,673 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:03:04" (1/1) ... [2025-03-17 02:03:04,673 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:03:04" (1/1) ... [2025-03-17 02:03:04,683 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:03:04" (1/1) ... [2025-03-17 02:03:04,684 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:03:04" (1/1) ... [2025-03-17 02:03:04,689 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:03:04" (1/1) ... [2025-03-17 02:03:04,690 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:03:04" (1/1) ... [2025-03-17 02:03:04,695 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 02:03:04,696 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 02:03:04,696 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 02:03:04,696 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 02:03:04,698 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:03:04" (1/1) ... [2025-03-17 02:03:04,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 02:03:04,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:03:04,724 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 02:03:04,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 02:03:04,742 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 02:03:04,743 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 02:03:04,743 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 02:03:04,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 02:03:04,743 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 02:03:04,743 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 02:03:04,807 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 02:03:04,809 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 02:03:05,238 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2025-03-17 02:03:05,239 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 02:03:05,260 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 02:03:05,262 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 02:03:05,262 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:03:05 BoogieIcfgContainer [2025-03-17 02:03:05,262 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 02:03:05,264 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 02:03:05,264 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 02:03:05,267 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 02:03:05,268 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:03:04" (1/3) ... [2025-03-17 02:03:05,268 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d499f96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:03:05, skipping insertion in model container [2025-03-17 02:03:05,269 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:03:04" (2/3) ... [2025-03-17 02:03:05,269 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d499f96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:03:05, skipping insertion in model container [2025-03-17 02:03:05,269 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:03:05" (3/3) ... [2025-03-17 02:03:05,270 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-86.i [2025-03-17 02:03:05,286 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 02:03:05,287 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-86.i that has 2 procedures, 92 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 02:03:05,338 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 02:03:05,348 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;@32b3cf69, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 02:03:05,349 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 02:03:05,352 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 62 states have (on average 1.5161290322580645) internal successors, (94), 63 states have internal predecessors, (94), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-17 02:03:05,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-17 02:03:05,365 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:03:05,366 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:03:05,366 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:03:05,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:03:05,371 INFO L85 PathProgramCache]: Analyzing trace with hash -280538662, now seen corresponding path program 1 times [2025-03-17 02:03:05,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:03:05,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149253056] [2025-03-17 02:03:05,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:03:05,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:03:05,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-17 02:03:05,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-17 02:03:05,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:03:05,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:03:05,662 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 1352 trivial. 0 not checked. [2025-03-17 02:03:05,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:03:05,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149253056] [2025-03-17 02:03:05,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149253056] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 02:03:05,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [902012801] [2025-03-17 02:03:05,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:03:05,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 02:03:05,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:03:05,667 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 02:03:05,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 02:03:05,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-17 02:03:05,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-17 02:03:05,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:03:05,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:03:05,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 02:03:05,820 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 02:03:05,846 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 1352 trivial. 0 not checked. [2025-03-17 02:03:05,846 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 02:03:05,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [902012801] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:03:05,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 02:03:05,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 02:03:05,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740021682] [2025-03-17 02:03:05,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:03:05,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 02:03:05,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:03:05,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 02:03:05,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 02:03:05,868 INFO L87 Difference]: Start difference. First operand has 92 states, 62 states have (on average 1.5161290322580645) internal successors, (94), 63 states have internal predecessors, (94), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-17 02:03:05,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:03:05,901 INFO L93 Difference]: Finished difference Result 181 states and 321 transitions. [2025-03-17 02:03:05,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 02:03:05,903 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) Word has length 171 [2025-03-17 02:03:05,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:03:05,908 INFO L225 Difference]: With dead ends: 181 [2025-03-17 02:03:05,909 INFO L226 Difference]: Without dead ends: 90 [2025-03-17 02:03:05,913 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 02:03:05,915 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 02:03:05,915 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 139 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 02:03:05,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-03-17 02:03:05,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2025-03-17 02:03:05,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 61 states have (on average 1.459016393442623) internal successors, (89), 61 states have internal predecessors, (89), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-17 02:03:05,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 143 transitions. [2025-03-17 02:03:05,946 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 143 transitions. Word has length 171 [2025-03-17 02:03:05,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:03:05,947 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 143 transitions. [2025-03-17 02:03:05,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-17 02:03:05,947 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 143 transitions. [2025-03-17 02:03:05,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-17 02:03:05,949 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:03:05,949 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:03:05,955 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 02:03:06,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 02:03:06,154 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:03:06,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:03:06,155 INFO L85 PathProgramCache]: Analyzing trace with hash 36761369, now seen corresponding path program 1 times [2025-03-17 02:03:06,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:03:06,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481287348] [2025-03-17 02:03:06,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:03:06,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:03:06,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-17 02:03:06,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-17 02:03:06,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:03:06,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:03:06,447 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-17 02:03:06,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:03:06,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481287348] [2025-03-17 02:03:06,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481287348] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:03:06,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:03:06,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 02:03:06,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153283108] [2025-03-17 02:03:06,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:03:06,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 02:03:06,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:03:06,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 02:03:06,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 02:03:06,451 INFO L87 Difference]: Start difference. First operand 90 states and 143 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-17 02:03:06,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:03:06,485 INFO L93 Difference]: Finished difference Result 180 states and 287 transitions. [2025-03-17 02:03:06,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 02:03:06,490 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 171 [2025-03-17 02:03:06,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:03:06,492 INFO L225 Difference]: With dead ends: 180 [2025-03-17 02:03:06,492 INFO L226 Difference]: Without dead ends: 91 [2025-03-17 02:03:06,492 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 02:03:06,493 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 02:03:06,493 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 271 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 02:03:06,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-03-17 02:03:06,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2025-03-17 02:03:06,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 62 states have (on average 1.4516129032258065) internal successors, (90), 62 states have internal predecessors, (90), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-17 02:03:06,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 144 transitions. [2025-03-17 02:03:06,509 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 144 transitions. Word has length 171 [2025-03-17 02:03:06,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:03:06,510 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 144 transitions. [2025-03-17 02:03:06,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-17 02:03:06,510 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 144 transitions. [2025-03-17 02:03:06,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-17 02:03:06,513 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:03:06,513 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:03:06,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 02:03:06,514 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:03:06,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:03:06,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1390071066, now seen corresponding path program 1 times [2025-03-17 02:03:06,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:03:06,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134174454] [2025-03-17 02:03:06,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:03:06,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:03:06,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-17 02:03:06,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-17 02:03:06,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:03:06,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:03:06,792 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-17 02:03:06,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:03:06,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134174454] [2025-03-17 02:03:06,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134174454] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:03:06,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:03:06,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 02:03:06,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136290533] [2025-03-17 02:03:06,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:03:06,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 02:03:06,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:03:06,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 02:03:06,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 02:03:06,794 INFO L87 Difference]: Start difference. First operand 91 states and 144 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-17 02:03:07,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:03:07,021 INFO L93 Difference]: Finished difference Result 272 states and 431 transitions. [2025-03-17 02:03:07,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 02:03:07,022 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 171 [2025-03-17 02:03:07,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:03:07,024 INFO L225 Difference]: With dead ends: 272 [2025-03-17 02:03:07,024 INFO L226 Difference]: Without dead ends: 182 [2025-03-17 02:03:07,025 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 02:03:07,028 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 145 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 02:03:07,029 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 475 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 02:03:07,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2025-03-17 02:03:07,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 163. [2025-03-17 02:03:07,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 106 states have (on average 1.4245283018867925) internal successors, (151), 106 states have internal predecessors, (151), 54 states have call successors, (54), 2 states have call predecessors, (54), 2 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-17 02:03:07,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 259 transitions. [2025-03-17 02:03:07,058 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 259 transitions. Word has length 171 [2025-03-17 02:03:07,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:03:07,058 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 259 transitions. [2025-03-17 02:03:07,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-17 02:03:07,059 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 259 transitions. [2025-03-17 02:03:07,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-17 02:03:07,060 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:03:07,060 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:03:07,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 02:03:07,060 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:03:07,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:03:07,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1096668059, now seen corresponding path program 1 times [2025-03-17 02:03:07,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:03:07,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166337770] [2025-03-17 02:03:07,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:03:07,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:03:07,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-17 02:03:07,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-17 02:03:07,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:03:07,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:03:12,880 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-17 02:03:12,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:03:12,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166337770] [2025-03-17 02:03:12,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166337770] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:03:12,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:03:12,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-17 02:03:12,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035688184] [2025-03-17 02:03:12,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:03:12,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 02:03:12,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:03:12,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 02:03:12,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2025-03-17 02:03:12,882 INFO L87 Difference]: Start difference. First operand 163 states and 259 transitions. Second operand has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-17 02:03:15,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:03:15,156 INFO L93 Difference]: Finished difference Result 324 states and 503 transitions. [2025-03-17 02:03:15,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 02:03:15,156 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 171 [2025-03-17 02:03:15,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:03:15,159 INFO L225 Difference]: With dead ends: 324 [2025-03-17 02:03:15,159 INFO L226 Difference]: Without dead ends: 234 [2025-03-17 02:03:15,160 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=149, Invalid=403, Unknown=0, NotChecked=0, Total=552 [2025-03-17 02:03:15,160 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 376 mSDsluCounter, 623 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 749 SdHoareTripleChecker+Invalid, 626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-17 02:03:15,161 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [376 Valid, 749 Invalid, 626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-17 02:03:15,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2025-03-17 02:03:15,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 179. [2025-03-17 02:03:15,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 122 states have (on average 1.4180327868852458) internal successors, (173), 122 states have internal predecessors, (173), 54 states have call successors, (54), 2 states have call predecessors, (54), 2 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-17 02:03:15,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 281 transitions. [2025-03-17 02:03:15,180 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 281 transitions. Word has length 171 [2025-03-17 02:03:15,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:03:15,181 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 281 transitions. [2025-03-17 02:03:15,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-17 02:03:15,181 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 281 transitions. [2025-03-17 02:03:15,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-17 02:03:15,184 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:03:15,184 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:03:15,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 02:03:15,185 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:03:15,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:03:15,186 INFO L85 PathProgramCache]: Analyzing trace with hash 900154554, now seen corresponding path program 1 times [2025-03-17 02:03:15,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:03:15,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921517531] [2025-03-17 02:03:15,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:03:15,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:03:15,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-17 02:03:15,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-17 02:03:15,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:03:15,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:03:15,251 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-17 02:03:15,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:03:15,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921517531] [2025-03-17 02:03:15,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921517531] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:03:15,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:03:15,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 02:03:15,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260583909] [2025-03-17 02:03:15,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:03:15,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 02:03:15,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:03:15,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 02:03:15,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 02:03:15,254 INFO L87 Difference]: Start difference. First operand 179 states and 281 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-17 02:03:15,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:03:15,299 INFO L93 Difference]: Finished difference Result 358 states and 565 transitions. [2025-03-17 02:03:15,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 02:03:15,299 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 171 [2025-03-17 02:03:15,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:03:15,303 INFO L225 Difference]: With dead ends: 358 [2025-03-17 02:03:15,303 INFO L226 Difference]: Without dead ends: 268 [2025-03-17 02:03:15,304 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 02:03:15,304 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 135 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 02:03:15,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 279 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 02:03:15,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2025-03-17 02:03:15,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 266. [2025-03-17 02:03:15,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 181 states have (on average 1.4143646408839778) internal successors, (256), 181 states have internal predecessors, (256), 81 states have call successors, (81), 3 states have call predecessors, (81), 3 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2025-03-17 02:03:15,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 418 transitions. [2025-03-17 02:03:15,331 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 418 transitions. Word has length 171 [2025-03-17 02:03:15,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:03:15,331 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 418 transitions. [2025-03-17 02:03:15,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-17 02:03:15,331 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 418 transitions. [2025-03-17 02:03:15,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-17 02:03:15,333 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:03:15,333 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:03:15,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 02:03:15,333 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:03:15,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:03:15,333 INFO L85 PathProgramCache]: Analyzing trace with hash -360196438, now seen corresponding path program 1 times [2025-03-17 02:03:15,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:03:15,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070662003] [2025-03-17 02:03:15,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:03:15,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:03:15,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-17 02:03:15,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-17 02:03:15,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:03:15,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:03:19,871 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-17 02:03:19,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:03:19,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070662003] [2025-03-17 02:03:19,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070662003] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:03:19,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:03:19,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-17 02:03:19,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310847347] [2025-03-17 02:03:19,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:03:19,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 02:03:19,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:03:19,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 02:03:19,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-03-17 02:03:19,873 INFO L87 Difference]: Start difference. First operand 266 states and 418 transitions. Second operand has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-17 02:03:22,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:03:22,512 INFO L93 Difference]: Finished difference Result 312 states and 472 transitions. [2025-03-17 02:03:22,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 02:03:22,514 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 172 [2025-03-17 02:03:22,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:03:22,517 INFO L225 Difference]: With dead ends: 312 [2025-03-17 02:03:22,517 INFO L226 Difference]: Without dead ends: 310 [2025-03-17 02:03:22,517 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=172, Invalid=478, Unknown=0, NotChecked=0, Total=650 [2025-03-17 02:03:22,519 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 272 mSDsluCounter, 746 mSDsCounter, 0 mSdLazyCounter, 592 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 872 SdHoareTripleChecker+Invalid, 674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-17 02:03:22,519 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 872 Invalid, 674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 592 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-17 02:03:22,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2025-03-17 02:03:22,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 267. [2025-03-17 02:03:22,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 182 states have (on average 1.4120879120879122) internal successors, (257), 182 states have internal predecessors, (257), 81 states have call successors, (81), 3 states have call predecessors, (81), 3 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2025-03-17 02:03:22,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 419 transitions. [2025-03-17 02:03:22,546 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 419 transitions. Word has length 172 [2025-03-17 02:03:22,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:03:22,547 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 419 transitions. [2025-03-17 02:03:22,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-17 02:03:22,547 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 419 transitions. [2025-03-17 02:03:22,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-17 02:03:22,548 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:03:22,548 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:03:22,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 02:03:22,549 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:03:22,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:03:22,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1934500659, now seen corresponding path program 1 times [2025-03-17 02:03:22,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:03:22,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943237537] [2025-03-17 02:03:22,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:03:22,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:03:22,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-17 02:03:22,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-17 02:03:22,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:03:22,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:03:22,668 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-17 02:03:22,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:03:22,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943237537] [2025-03-17 02:03:22,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943237537] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:03:22,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:03:22,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 02:03:22,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074491982] [2025-03-17 02:03:22,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:03:22,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 02:03:22,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:03:22,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 02:03:22,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 02:03:22,670 INFO L87 Difference]: Start difference. First operand 267 states and 419 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-17 02:03:22,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:03:22,703 INFO L93 Difference]: Finished difference Result 455 states and 714 transitions. [2025-03-17 02:03:22,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 02:03:22,705 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 172 [2025-03-17 02:03:22,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:03:22,706 INFO L225 Difference]: With dead ends: 455 [2025-03-17 02:03:22,707 INFO L226 Difference]: Without dead ends: 275 [2025-03-17 02:03:22,707 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 02:03:22,708 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 6 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 02:03:22,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 262 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 02:03:22,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2025-03-17 02:03:22,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 267. [2025-03-17 02:03:22,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 182 states have (on average 1.3956043956043955) internal successors, (254), 182 states have internal predecessors, (254), 81 states have call successors, (81), 3 states have call predecessors, (81), 3 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2025-03-17 02:03:22,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 416 transitions. [2025-03-17 02:03:22,721 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 416 transitions. Word has length 172 [2025-03-17 02:03:22,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:03:22,723 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 416 transitions. [2025-03-17 02:03:22,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-17 02:03:22,723 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 416 transitions. [2025-03-17 02:03:22,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-17 02:03:22,725 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:03:22,725 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:03:22,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 02:03:22,726 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:03:22,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:03:22,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1905871508, now seen corresponding path program 1 times [2025-03-17 02:03:22,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:03:22,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811678680] [2025-03-17 02:03:22,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:03:22,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:03:22,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-17 02:03:22,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-17 02:03:22,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:03:22,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:03:26,813 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-17 02:03:26,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:03:26,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811678680] [2025-03-17 02:03:26,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811678680] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:03:26,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:03:26,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-17 02:03:26,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946638430] [2025-03-17 02:03:26,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:03:26,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 02:03:26,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:03:26,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 02:03:26,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2025-03-17 02:03:26,815 INFO L87 Difference]: Start difference. First operand 267 states and 416 transitions. Second operand has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-17 02:03:29,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:03:29,333 INFO L93 Difference]: Finished difference Result 312 states and 467 transitions. [2025-03-17 02:03:29,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 02:03:29,334 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 172 [2025-03-17 02:03:29,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:03:29,336 INFO L225 Difference]: With dead ends: 312 [2025-03-17 02:03:29,336 INFO L226 Difference]: Without dead ends: 310 [2025-03-17 02:03:29,337 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=165, Invalid=485, Unknown=0, NotChecked=0, Total=650 [2025-03-17 02:03:29,337 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 246 mSDsluCounter, 701 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 827 SdHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-17 02:03:29,337 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 827 Invalid, 549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-17 02:03:29,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2025-03-17 02:03:29,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 267. [2025-03-17 02:03:29,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 182 states have (on average 1.3956043956043955) internal successors, (254), 182 states have internal predecessors, (254), 81 states have call successors, (81), 3 states have call predecessors, (81), 3 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2025-03-17 02:03:29,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 416 transitions. [2025-03-17 02:03:29,352 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 416 transitions. Word has length 172 [2025-03-17 02:03:29,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:03:29,353 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 416 transitions. [2025-03-17 02:03:29,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-17 02:03:29,353 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 416 transitions. [2025-03-17 02:03:29,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-17 02:03:29,354 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:03:29,354 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:03:29,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 02:03:29,355 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:03:29,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:03:29,355 INFO L85 PathProgramCache]: Analyzing trace with hash 677687310, now seen corresponding path program 1 times [2025-03-17 02:03:29,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:03:29,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641411345] [2025-03-17 02:03:29,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:03:29,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:03:29,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-17 02:03:29,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-17 02:03:29,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:03:29,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:03:29,487 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-17 02:03:29,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:03:29,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641411345] [2025-03-17 02:03:29,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641411345] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:03:29,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:03:29,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 02:03:29,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744372698] [2025-03-17 02:03:29,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:03:29,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 02:03:29,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:03:29,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 02:03:29,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 02:03:29,489 INFO L87 Difference]: Start difference. First operand 267 states and 416 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-17 02:03:29,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:03:29,544 INFO L93 Difference]: Finished difference Result 589 states and 912 transitions. [2025-03-17 02:03:29,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 02:03:29,545 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 172 [2025-03-17 02:03:29,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:03:29,547 INFO L225 Difference]: With dead ends: 589 [2025-03-17 02:03:29,547 INFO L226 Difference]: Without dead ends: 412 [2025-03-17 02:03:29,548 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-17 02:03:29,548 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 90 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 02:03:29,548 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 323 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 02:03:29,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2025-03-17 02:03:29,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 360. [2025-03-17 02:03:29,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 275 states have (on average 1.461818181818182) internal successors, (402), 275 states have internal predecessors, (402), 81 states have call successors, (81), 3 states have call predecessors, (81), 3 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2025-03-17 02:03:29,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 564 transitions. [2025-03-17 02:03:29,565 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 564 transitions. Word has length 172 [2025-03-17 02:03:29,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:03:29,565 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 564 transitions. [2025-03-17 02:03:29,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-17 02:03:29,566 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 564 transitions. [2025-03-17 02:03:29,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-17 02:03:29,567 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:03:29,567 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:03:29,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 02:03:29,567 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:03:29,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:03:29,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1360368979, now seen corresponding path program 1 times [2025-03-17 02:03:29,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:03:29,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751327619] [2025-03-17 02:03:29,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:03:29,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:03:29,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-17 02:03:29,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-17 02:03:29,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:03:29,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:03:34,806 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-17 02:03:34,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:03:34,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751327619] [2025-03-17 02:03:34,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751327619] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:03:34,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:03:34,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-17 02:03:34,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615845877] [2025-03-17 02:03:34,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:03:34,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 02:03:34,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:03:34,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 02:03:34,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2025-03-17 02:03:34,808 INFO L87 Difference]: Start difference. First operand 360 states and 564 transitions. Second operand has 16 states, 16 states have (on average 2.5) internal successors, (40), 16 states have internal predecessors, (40), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-17 02:03:38,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:03:38,088 INFO L93 Difference]: Finished difference Result 677 states and 1034 transitions. [2025-03-17 02:03:38,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-17 02:03:38,089 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.5) internal successors, (40), 16 states have internal predecessors, (40), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 172 [2025-03-17 02:03:38,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:03:38,091 INFO L225 Difference]: With dead ends: 677 [2025-03-17 02:03:38,091 INFO L226 Difference]: Without dead ends: 423 [2025-03-17 02:03:38,092 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=234, Invalid=636, Unknown=0, NotChecked=0, Total=870 [2025-03-17 02:03:38,093 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 372 mSDsluCounter, 1014 mSDsCounter, 0 mSdLazyCounter, 897 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 1181 SdHoareTripleChecker+Invalid, 981 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 897 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-17 02:03:38,093 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [372 Valid, 1181 Invalid, 981 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 897 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-17 02:03:38,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2025-03-17 02:03:38,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 370. [2025-03-17 02:03:38,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 285 states have (on average 1.4526315789473685) internal successors, (414), 285 states have internal predecessors, (414), 81 states have call successors, (81), 3 states have call predecessors, (81), 3 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2025-03-17 02:03:38,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 576 transitions. [2025-03-17 02:03:38,116 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 576 transitions. Word has length 172 [2025-03-17 02:03:38,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:03:38,117 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 576 transitions. [2025-03-17 02:03:38,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.5) internal successors, (40), 16 states have internal predecessors, (40), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-17 02:03:38,117 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 576 transitions. [2025-03-17 02:03:38,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-17 02:03:38,120 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:03:38,120 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:03:38,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 02:03:38,120 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:03:38,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:03:38,121 INFO L85 PathProgramCache]: Analyzing trace with hash 382441356, now seen corresponding path program 1 times [2025-03-17 02:03:38,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:03:38,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922805527] [2025-03-17 02:03:38,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:03:38,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:03:38,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-17 02:03:38,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-17 02:03:38,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:03:38,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:03:42,950 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-17 02:03:42,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:03:42,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922805527] [2025-03-17 02:03:42,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922805527] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:03:42,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:03:42,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-17 02:03:42,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213203866] [2025-03-17 02:03:42,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:03:42,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 02:03:42,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:03:42,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 02:03:42,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2025-03-17 02:03:42,952 INFO L87 Difference]: Start difference. First operand 370 states and 576 transitions. Second operand has 16 states, 16 states have (on average 2.5) internal successors, (40), 16 states have internal predecessors, (40), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-17 02:03:45,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:03:45,569 INFO L93 Difference]: Finished difference Result 419 states and 632 transitions. [2025-03-17 02:03:45,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 02:03:45,570 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.5) internal successors, (40), 16 states have internal predecessors, (40), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 172 [2025-03-17 02:03:45,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:03:45,572 INFO L225 Difference]: With dead ends: 419 [2025-03-17 02:03:45,573 INFO L226 Difference]: Without dead ends: 417 [2025-03-17 02:03:45,573 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=233, Invalid=579, Unknown=0, NotChecked=0, Total=812 [2025-03-17 02:03:45,574 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 395 mSDsluCounter, 744 mSDsCounter, 0 mSdLazyCounter, 555 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 911 SdHoareTripleChecker+Invalid, 640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-17 02:03:45,574 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 911 Invalid, 640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 555 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-17 02:03:45,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2025-03-17 02:03:45,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 370. [2025-03-17 02:03:45,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 285 states have (on average 1.4526315789473685) internal successors, (414), 285 states have internal predecessors, (414), 81 states have call successors, (81), 3 states have call predecessors, (81), 3 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2025-03-17 02:03:45,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 576 transitions. [2025-03-17 02:03:45,598 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 576 transitions. Word has length 172 [2025-03-17 02:03:45,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:03:45,598 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 576 transitions. [2025-03-17 02:03:45,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.5) internal successors, (40), 16 states have internal predecessors, (40), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-17 02:03:45,598 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 576 transitions. [2025-03-17 02:03:45,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-17 02:03:45,600 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:03:45,600 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:03:45,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 02:03:45,600 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:03:45,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:03:45,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1050357497, now seen corresponding path program 1 times [2025-03-17 02:03:45,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:03:45,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212396034] [2025-03-17 02:03:45,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:03:45,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:03:45,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-17 02:03:45,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-17 02:03:45,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:03:45,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:03:51,167 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-17 02:03:51,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:03:51,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212396034] [2025-03-17 02:03:51,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212396034] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:03:51,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:03:51,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-17 02:03:51,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874908054] [2025-03-17 02:03:51,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:03:51,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-17 02:03:51,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:03:51,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-17 02:03:51,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2025-03-17 02:03:51,169 INFO L87 Difference]: Start difference. First operand 370 states and 576 transitions. Second operand has 17 states, 17 states have (on average 2.411764705882353) internal successors, (41), 17 states have internal predecessors, (41), 3 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 3 states have call predecessors, (27), 3 states have call successors, (27) [2025-03-17 02:03:54,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:03:54,697 INFO L93 Difference]: Finished difference Result 419 states and 632 transitions. [2025-03-17 02:03:54,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 02:03:54,697 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.411764705882353) internal successors, (41), 17 states have internal predecessors, (41), 3 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 3 states have call predecessors, (27), 3 states have call successors, (27) Word has length 173 [2025-03-17 02:03:54,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:03:54,700 INFO L225 Difference]: With dead ends: 419 [2025-03-17 02:03:54,700 INFO L226 Difference]: Without dead ends: 417 [2025-03-17 02:03:54,701 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=218, Invalid=652, Unknown=0, NotChecked=0, Total=870 [2025-03-17 02:03:54,701 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 347 mSDsluCounter, 767 mSDsCounter, 0 mSdLazyCounter, 823 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 889 SdHoareTripleChecker+Invalid, 960 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 823 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-17 02:03:54,701 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 889 Invalid, 960 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 823 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-17 02:03:54,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2025-03-17 02:03:54,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 368. [2025-03-17 02:03:54,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 283 states have (on average 1.452296819787986) internal successors, (411), 283 states have internal predecessors, (411), 81 states have call successors, (81), 3 states have call predecessors, (81), 3 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2025-03-17 02:03:54,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 573 transitions. [2025-03-17 02:03:54,720 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 573 transitions. Word has length 173 [2025-03-17 02:03:54,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:03:54,720 INFO L471 AbstractCegarLoop]: Abstraction has 368 states and 573 transitions. [2025-03-17 02:03:54,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.411764705882353) internal successors, (41), 17 states have internal predecessors, (41), 3 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 3 states have call predecessors, (27), 3 states have call successors, (27) [2025-03-17 02:03:54,720 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 573 transitions. [2025-03-17 02:03:54,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-17 02:03:54,722 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:03:54,722 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:03:54,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 02:03:54,722 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:03:54,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:03:54,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1058817949, now seen corresponding path program 1 times [2025-03-17 02:03:54,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:03:54,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370688012] [2025-03-17 02:03:54,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:03:54,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:03:54,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-17 02:03:54,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-17 02:03:54,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:03:54,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:04:03,451 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-17 02:04:03,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:04:03,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370688012] [2025-03-17 02:04:03,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370688012] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:04:03,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:04:03,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-17 02:04:03,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979876864] [2025-03-17 02:04:03,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:04:03,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 02:04:03,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:04:03,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 02:04:03,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2025-03-17 02:04:03,453 INFO L87 Difference]: Start difference. First operand 368 states and 573 transitions. Second operand has 16 states, 16 states have (on average 2.5625) internal successors, (41), 16 states have internal predecessors, (41), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-17 02:04:10,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:04:10,581 INFO L93 Difference]: Finished difference Result 439 states and 656 transitions. [2025-03-17 02:04:10,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-17 02:04:10,582 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.5625) internal successors, (41), 16 states have internal predecessors, (41), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 173 [2025-03-17 02:04:10,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:04:10,584 INFO L225 Difference]: With dead ends: 439 [2025-03-17 02:04:10,584 INFO L226 Difference]: Without dead ends: 437 [2025-03-17 02:04:10,584 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=298, Invalid=694, Unknown=0, NotChecked=0, Total=992 [2025-03-17 02:04:10,585 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 239 mSDsluCounter, 727 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 853 SdHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-17 02:04:10,585 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 853 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-17 02:04:10,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2025-03-17 02:04:10,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 372. [2025-03-17 02:04:10,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 287 states have (on average 1.4494773519163764) internal successors, (416), 287 states have internal predecessors, (416), 81 states have call successors, (81), 3 states have call predecessors, (81), 3 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2025-03-17 02:04:10,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 578 transitions. [2025-03-17 02:04:10,600 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 578 transitions. Word has length 173 [2025-03-17 02:04:10,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:04:10,600 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 578 transitions. [2025-03-17 02:04:10,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.5625) internal successors, (41), 16 states have internal predecessors, (41), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-17 02:04:10,600 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 578 transitions. [2025-03-17 02:04:10,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-17 02:04:10,602 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:04:10,602 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:04:10,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 02:04:10,603 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:04:10,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:04:10,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1493339012, now seen corresponding path program 1 times [2025-03-17 02:04:10,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:04:10,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754336926] [2025-03-17 02:04:10,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:04:10,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:04:10,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-17 02:04:10,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-17 02:04:10,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:04:10,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:04:21,251 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-17 02:04:21,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:04:21,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754336926] [2025-03-17 02:04:21,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754336926] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:04:21,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:04:21,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-17 02:04:21,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889244625] [2025-03-17 02:04:21,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:04:21,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-17 02:04:21,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:04:21,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-17 02:04:21,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2025-03-17 02:04:21,252 INFO L87 Difference]: Start difference. First operand 372 states and 578 transitions. Second operand has 17 states, 17 states have (on average 2.411764705882353) internal successors, (41), 17 states have internal predecessors, (41), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-17 02:04:26,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:04:26,938 INFO L93 Difference]: Finished difference Result 421 states and 634 transitions. [2025-03-17 02:04:26,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 02:04:26,939 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.411764705882353) internal successors, (41), 17 states have internal predecessors, (41), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 173 [2025-03-17 02:04:26,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:04:26,940 INFO L225 Difference]: With dead ends: 421 [2025-03-17 02:04:26,940 INFO L226 Difference]: Without dead ends: 419 [2025-03-17 02:04:26,941 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=265, Invalid=605, Unknown=0, NotChecked=0, Total=870 [2025-03-17 02:04:26,941 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 260 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 708 SdHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-17 02:04:26,942 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 708 Invalid, 573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 461 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-17 02:04:26,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2025-03-17 02:04:26,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 367. [2025-03-17 02:04:26,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 282 states have (on average 1.4539007092198581) internal successors, (410), 282 states have internal predecessors, (410), 81 states have call successors, (81), 3 states have call predecessors, (81), 3 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2025-03-17 02:04:26,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 572 transitions. [2025-03-17 02:04:26,954 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 572 transitions. Word has length 173 [2025-03-17 02:04:26,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:04:26,954 INFO L471 AbstractCegarLoop]: Abstraction has 367 states and 572 transitions. [2025-03-17 02:04:26,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.411764705882353) internal successors, (41), 17 states have internal predecessors, (41), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-17 02:04:26,954 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 572 transitions. [2025-03-17 02:04:26,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-17 02:04:26,955 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:04:26,955 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:04:26,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 02:04:26,955 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:04:26,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:04:26,956 INFO L85 PathProgramCache]: Analyzing trace with hash 781096503, now seen corresponding path program 1 times [2025-03-17 02:04:26,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:04:26,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693477880] [2025-03-17 02:04:26,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:04:26,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:04:26,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-17 02:04:26,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-17 02:04:26,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:04:26,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:04:31,088 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-17 02:04:31,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:04:31,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693477880] [2025-03-17 02:04:31,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693477880] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:04:31,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:04:31,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-03-17 02:04:31,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673283688] [2025-03-17 02:04:31,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:04:31,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-17 02:04:31,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:04:31,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-17 02:04:31,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2025-03-17 02:04:31,091 INFO L87 Difference]: Start difference. First operand 367 states and 572 transitions. Second operand has 19 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 19 states have internal predecessors, (41), 3 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 3 states have call predecessors, (27), 3 states have call successors, (27) [2025-03-17 02:04:33,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:04:33,112 INFO L93 Difference]: Finished difference Result 426 states and 639 transitions. [2025-03-17 02:04:33,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-17 02:04:33,113 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 19 states have internal predecessors, (41), 3 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 3 states have call predecessors, (27), 3 states have call successors, (27) Word has length 173 [2025-03-17 02:04:33,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:04:33,114 INFO L225 Difference]: With dead ends: 426 [2025-03-17 02:04:33,115 INFO L226 Difference]: Without dead ends: 424 [2025-03-17 02:04:33,116 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=289, Invalid=833, Unknown=0, NotChecked=0, Total=1122 [2025-03-17 02:04:33,117 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 459 mSDsluCounter, 953 mSDsCounter, 0 mSdLazyCounter, 920 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 1114 SdHoareTripleChecker+Invalid, 1090 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 920 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-17 02:04:33,117 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [459 Valid, 1114 Invalid, 1090 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 920 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-17 02:04:33,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2025-03-17 02:04:33,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 377. [2025-03-17 02:04:33,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 292 states have (on average 1.4486301369863013) internal successors, (423), 292 states have internal predecessors, (423), 81 states have call successors, (81), 3 states have call predecessors, (81), 3 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2025-03-17 02:04:33,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 585 transitions. [2025-03-17 02:04:33,135 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 585 transitions. Word has length 173 [2025-03-17 02:04:33,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:04:33,136 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 585 transitions. [2025-03-17 02:04:33,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 19 states have internal predecessors, (41), 3 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 3 states have call predecessors, (27), 3 states have call successors, (27) [2025-03-17 02:04:33,136 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 585 transitions. [2025-03-17 02:04:33,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-17 02:04:33,137 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:04:33,137 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:04:33,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 02:04:33,137 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:04:33,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:04:33,137 INFO L85 PathProgramCache]: Analyzing trace with hash -764608358, now seen corresponding path program 1 times [2025-03-17 02:04:33,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:04:33,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982256368] [2025-03-17 02:04:33,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:04:33,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:04:33,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-17 02:04:33,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-17 02:04:33,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:04:33,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat