./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-10.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-10.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 17124c627a77300cd44285b9c4c316438e4d73c0a011ab8330c0a1114bb82733 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 19:31:59,750 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 19:31:59,801 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 19:31:59,806 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 19:31:59,806 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 19:31:59,826 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 19:31:59,826 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 19:31:59,826 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 19:31:59,827 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 19:31:59,827 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 19:31:59,827 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 19:31:59,827 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 19:31:59,827 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 19:31:59,827 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 19:31:59,827 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 19:31:59,827 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 19:31:59,828 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 19:31:59,828 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 19:31:59,828 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 19:31:59,828 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 19:31:59,828 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 19:31:59,828 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 19:31:59,828 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 19:31:59,828 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 19:31:59,828 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 19:31:59,828 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 19:31:59,828 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 19:31:59,829 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 19:31:59,829 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 19:31:59,829 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 19:31:59,829 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 19:31:59,829 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 19:31:59,829 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:31:59,829 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 19:31:59,829 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 19:31:59,829 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 19:31:59,829 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 19:31:59,829 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 19:31:59,829 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 19:31:59,830 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 19:31:59,830 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 19:31:59,830 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 19:31:59,830 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 19:31:59,830 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 -> 17124c627a77300cd44285b9c4c316438e4d73c0a011ab8330c0a1114bb82733 [2025-03-03 19:32:00,063 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 19:32:00,070 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 19:32:00,074 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 19:32:00,075 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 19:32:00,075 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 19:32:00,076 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-10.i [2025-03-03 19:32:01,208 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8181212c9/72352ce1320c4ac4a4779d32f1d9520f/FLAG4db7ab30b [2025-03-03 19:32:01,432 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 19:32:01,433 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-10.i [2025-03-03 19:32:01,438 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8181212c9/72352ce1320c4ac4a4779d32f1d9520f/FLAG4db7ab30b [2025-03-03 19:32:01,784 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8181212c9/72352ce1320c4ac4a4779d32f1d9520f [2025-03-03 19:32:01,786 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 19:32:01,787 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 19:32:01,788 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 19:32:01,788 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 19:32:01,791 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 19:32:01,791 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:32:01" (1/1) ... [2025-03-03 19:32:01,792 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1485a27a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:32:01, skipping insertion in model container [2025-03-03 19:32:01,792 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:32:01" (1/1) ... [2025-03-03 19:32:01,810 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 19:32:01,905 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-10.i[915,928] [2025-03-03 19:32:01,967 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:32:01,980 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 19:32:01,990 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-10.i[915,928] [2025-03-03 19:32:02,022 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:32:02,038 INFO L204 MainTranslator]: Completed translation [2025-03-03 19:32:02,039 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:32:02 WrapperNode [2025-03-03 19:32:02,039 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 19:32:02,041 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 19:32:02,041 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 19:32:02,041 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 19:32:02,045 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:32:02" (1/1) ... [2025-03-03 19:32:02,056 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:32:02" (1/1) ... [2025-03-03 19:32:02,093 INFO L138 Inliner]: procedures = 26, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 211 [2025-03-03 19:32:02,098 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 19:32:02,098 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 19:32:02,098 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 19:32:02,099 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 19:32:02,104 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:32:02" (1/1) ... [2025-03-03 19:32:02,105 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:32:02" (1/1) ... [2025-03-03 19:32:02,109 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:32:02" (1/1) ... [2025-03-03 19:32:02,130 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 19:32:02,130 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:32:02" (1/1) ... [2025-03-03 19:32:02,130 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:32:02" (1/1) ... [2025-03-03 19:32:02,138 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:32:02" (1/1) ... [2025-03-03 19:32:02,139 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:32:02" (1/1) ... [2025-03-03 19:32:02,140 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:32:02" (1/1) ... [2025-03-03 19:32:02,141 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:32:02" (1/1) ... [2025-03-03 19:32:02,145 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 19:32:02,152 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 19:32:02,152 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 19:32:02,152 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 19:32:02,153 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:32:02" (1/1) ... [2025-03-03 19:32:02,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:32:02,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:32:02,178 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 19:32:02,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 19:32:02,199 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 19:32:02,199 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 19:32:02,199 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 19:32:02,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 19:32:02,199 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 19:32:02,199 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 19:32:02,262 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 19:32:02,263 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 19:32:02,540 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L150: havoc property_#t~bitwise21#1;havoc property_#t~ite23#1;havoc property_#t~bitwise22#1;havoc property_#t~short24#1; [2025-03-03 19:32:02,568 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2025-03-03 19:32:02,569 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 19:32:02,585 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 19:32:02,585 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 19:32:02,586 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:32:02 BoogieIcfgContainer [2025-03-03 19:32:02,586 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 19:32:02,588 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 19:32:02,588 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 19:32:02,591 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 19:32:02,591 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 07:32:01" (1/3) ... [2025-03-03 19:32:02,592 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@589a695a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:32:02, skipping insertion in model container [2025-03-03 19:32:02,592 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:32:02" (2/3) ... [2025-03-03 19:32:02,592 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@589a695a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:32:02, skipping insertion in model container [2025-03-03 19:32:02,592 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:32:02" (3/3) ... [2025-03-03 19:32:02,593 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-10.i [2025-03-03 19:32:02,602 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 19:32:02,603 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-10.i that has 2 procedures, 91 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 19:32:02,639 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 19:32:02,646 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;@1c6a4b18, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 19:32:02,647 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 19:32:02,649 INFO L276 IsEmpty]: Start isEmpty. Operand has 91 states, 63 states have (on average 1.3968253968253967) internal successors, (88), 64 states have internal predecessors, (88), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-03 19:32:02,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-03 19:32:02,658 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:32:02,659 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:32:02,659 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:32:02,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:32:02,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1102471577, now seen corresponding path program 1 times [2025-03-03 19:32:02,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:32:02,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562603560] [2025-03-03 19:32:02,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:32:02,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:32:02,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-03 19:32:02,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-03 19:32:02,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:32:02,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:32:02,931 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 1152 trivial. 0 not checked. [2025-03-03 19:32:02,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:32:02,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562603560] [2025-03-03 19:32:02,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562603560] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:32:02,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [388815548] [2025-03-03 19:32:02,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:32:02,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:32:02,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:32:02,936 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 19:32:02,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 19:32:03,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-03 19:32:03,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-03 19:32:03,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:32:03,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:32:03,079 INFO L256 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 19:32:03,088 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:32:03,115 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 1152 trivial. 0 not checked. [2025-03-03 19:32:03,117 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 19:32:03,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [388815548] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:32:03,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 19:32:03,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 19:32:03,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750519059] [2025-03-03 19:32:03,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:32:03,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 19:32:03,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:32:03,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 19:32:03,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 19:32:03,141 INFO L87 Difference]: Start difference. First operand has 91 states, 63 states have (on average 1.3968253968253967) internal successors, (88), 64 states have internal predecessors, (88), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-03 19:32:03,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:32:03,176 INFO L93 Difference]: Finished difference Result 176 states and 296 transitions. [2025-03-03 19:32:03,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 19:32:03,177 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) Word has length 164 [2025-03-03 19:32:03,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:32:03,182 INFO L225 Difference]: With dead ends: 176 [2025-03-03 19:32:03,183 INFO L226 Difference]: Without dead ends: 88 [2025-03-03 19:32:03,186 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 19:32:03,188 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:32:03,189 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:32:03,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-03-03 19:32:03,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2025-03-03 19:32:03,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 61 states have (on average 1.3442622950819672) internal successors, (82), 61 states have internal predecessors, (82), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-03 19:32:03,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 132 transitions. [2025-03-03 19:32:03,225 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 132 transitions. Word has length 164 [2025-03-03 19:32:03,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:32:03,226 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 132 transitions. [2025-03-03 19:32:03,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-03 19:32:03,226 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 132 transitions. [2025-03-03 19:32:03,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-03 19:32:03,232 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:32:03,232 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:32:03,239 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 19:32:03,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 19:32:03,436 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:32:03,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:32:03,437 INFO L85 PathProgramCache]: Analyzing trace with hash 674050696, now seen corresponding path program 1 times [2025-03-03 19:32:03,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:32:03,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472616203] [2025-03-03 19:32:03,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:32:03,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:32:03,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-03 19:32:03,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-03 19:32:03,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:32:03,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:32:03,899 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-03 19:32:03,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:32:03,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472616203] [2025-03-03 19:32:03,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472616203] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:32:03,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:32:03,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 19:32:03,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641505843] [2025-03-03 19:32:03,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:32:03,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 19:32:03,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:32:03,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 19:32:03,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 19:32:03,902 INFO L87 Difference]: Start difference. First operand 88 states and 132 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-03 19:32:04,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:32:04,087 INFO L93 Difference]: Finished difference Result 259 states and 391 transitions. [2025-03-03 19:32:04,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 19:32:04,087 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 165 [2025-03-03 19:32:04,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:32:04,089 INFO L225 Difference]: With dead ends: 259 [2025-03-03 19:32:04,089 INFO L226 Difference]: Without dead ends: 174 [2025-03-03 19:32:04,090 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 19:32:04,091 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 93 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 19:32:04,091 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 358 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 19:32:04,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2025-03-03 19:32:04,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 140. [2025-03-03 19:32:04,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 87 states have (on average 1.2873563218390804) internal successors, (112), 87 states have internal predecessors, (112), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-03 19:32:04,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 212 transitions. [2025-03-03 19:32:04,119 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 212 transitions. Word has length 165 [2025-03-03 19:32:04,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:32:04,120 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 212 transitions. [2025-03-03 19:32:04,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-03 19:32:04,120 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 212 transitions. [2025-03-03 19:32:04,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-03 19:32:04,121 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:32:04,121 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:32:04,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 19:32:04,122 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:32:04,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:32:04,122 INFO L85 PathProgramCache]: Analyzing trace with hash 854641199, now seen corresponding path program 1 times [2025-03-03 19:32:04,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:32:04,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156143482] [2025-03-03 19:32:04,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:32:04,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:32:04,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-03 19:32:04,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-03 19:32:04,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:32:04,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:32:04,389 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-03 19:32:04,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:32:04,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156143482] [2025-03-03 19:32:04,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156143482] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:32:04,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:32:04,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 19:32:04,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483500660] [2025-03-03 19:32:04,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:32:04,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 19:32:04,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:32:04,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 19:32:04,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 19:32:04,391 INFO L87 Difference]: Start difference. First operand 140 states and 212 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-03 19:32:04,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:32:04,531 INFO L93 Difference]: Finished difference Result 237 states and 353 transitions. [2025-03-03 19:32:04,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 19:32:04,533 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 166 [2025-03-03 19:32:04,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:32:04,535 INFO L225 Difference]: With dead ends: 237 [2025-03-03 19:32:04,537 INFO L226 Difference]: Without dead ends: 150 [2025-03-03 19:32:04,538 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 19:32:04,539 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 112 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 19:32:04,539 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 216 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 19:32:04,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2025-03-03 19:32:04,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2025-03-03 19:32:04,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 95 states have (on average 1.263157894736842) internal successors, (120), 95 states have internal predecessors, (120), 50 states have call successors, (50), 4 states have call predecessors, (50), 4 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-03 19:32:04,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 220 transitions. [2025-03-03 19:32:04,568 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 220 transitions. Word has length 166 [2025-03-03 19:32:04,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:32:04,569 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 220 transitions. [2025-03-03 19:32:04,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-03 19:32:04,569 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 220 transitions. [2025-03-03 19:32:04,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-03 19:32:04,577 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:32:04,577 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:32:04,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 19:32:04,577 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:32:04,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:32:04,578 INFO L85 PathProgramCache]: Analyzing trace with hash 548067048, now seen corresponding path program 1 times [2025-03-03 19:32:04,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:32:04,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926469087] [2025-03-03 19:32:04,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:32:04,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:32:04,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 19:32:04,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 19:32:04,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:32:04,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:32:04,769 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-03 19:32:04,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:32:04,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926469087] [2025-03-03 19:32:04,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926469087] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:32:04,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:32:04,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 19:32:04,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984076187] [2025-03-03 19:32:04,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:32:04,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 19:32:04,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:32:04,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 19:32:04,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:32:04,772 INFO L87 Difference]: Start difference. First operand 150 states and 220 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-03 19:32:04,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:32:04,803 INFO L93 Difference]: Finished difference Result 242 states and 355 transitions. [2025-03-03 19:32:04,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 19:32:04,804 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 167 [2025-03-03 19:32:04,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:32:04,807 INFO L225 Difference]: With dead ends: 242 [2025-03-03 19:32:04,808 INFO L226 Difference]: Without dead ends: 150 [2025-03-03 19:32:04,809 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:32:04,809 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 124 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:32:04,809 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 262 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:32:04,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2025-03-03 19:32:04,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2025-03-03 19:32:04,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 95 states have (on average 1.2421052631578948) internal successors, (118), 95 states have internal predecessors, (118), 50 states have call successors, (50), 4 states have call predecessors, (50), 4 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-03 19:32:04,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 218 transitions. [2025-03-03 19:32:04,833 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 218 transitions. Word has length 167 [2025-03-03 19:32:04,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:32:04,834 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 218 transitions. [2025-03-03 19:32:04,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-03 19:32:04,834 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 218 transitions. [2025-03-03 19:32:04,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-03 19:32:04,836 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:32:04,836 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:32:04,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 19:32:04,836 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:32:04,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:32:04,837 INFO L85 PathProgramCache]: Analyzing trace with hash 759417961, now seen corresponding path program 1 times [2025-03-03 19:32:04,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:32:04,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254955824] [2025-03-03 19:32:04,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:32:04,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:32:04,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 19:32:04,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 19:32:04,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:32:04,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:32:48,709 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-03 19:32:48,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:32:48,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254955824] [2025-03-03 19:32:48,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254955824] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:32:48,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:32:48,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-03 19:32:48,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478655933] [2025-03-03 19:32:48,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:32:48,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-03 19:32:48,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:32:48,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-03 19:32:48,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2025-03-03 19:32:48,712 INFO L87 Difference]: Start difference. First operand 150 states and 218 transitions. Second operand has 15 states, 15 states have (on average 3.0) internal successors, (45), 15 states have internal predecessors, (45), 3 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) [2025-03-03 19:32:50,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:32:50,808 INFO L93 Difference]: Finished difference Result 455 states and 643 transitions. [2025-03-03 19:32:50,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 19:32:50,809 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.0) internal successors, (45), 15 states have internal predecessors, (45), 3 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) Word has length 167 [2025-03-03 19:32:50,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:32:50,811 INFO L225 Difference]: With dead ends: 455 [2025-03-03 19:32:50,811 INFO L226 Difference]: Without dead ends: 365 [2025-03-03 19:32:50,812 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=181, Invalid=521, Unknown=0, NotChecked=0, Total=702 [2025-03-03 19:32:50,814 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 641 mSDsluCounter, 750 mSDsCounter, 0 mSdLazyCounter, 1195 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 641 SdHoareTripleChecker+Valid, 867 SdHoareTripleChecker+Invalid, 1312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 1195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 19:32:50,814 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [641 Valid, 867 Invalid, 1312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 1195 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 19:32:50,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2025-03-03 19:32:50,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 254. [2025-03-03 19:32:50,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 175 states have (on average 1.262857142857143) internal successors, (221), 176 states have internal predecessors, (221), 68 states have call successors, (68), 10 states have call predecessors, (68), 10 states have return successors, (68), 67 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-03 19:32:50,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 357 transitions. [2025-03-03 19:32:50,847 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 357 transitions. Word has length 167 [2025-03-03 19:32:50,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:32:50,848 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 357 transitions. [2025-03-03 19:32:50,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.0) internal successors, (45), 15 states have internal predecessors, (45), 3 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) [2025-03-03 19:32:50,849 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 357 transitions. [2025-03-03 19:32:50,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-03 19:32:50,851 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:32:50,851 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:32:50,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 19:32:50,852 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:32:50,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:32:50,854 INFO L85 PathProgramCache]: Analyzing trace with hash 888500680, now seen corresponding path program 1 times [2025-03-03 19:32:50,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:32:50,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270401903] [2025-03-03 19:32:50,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:32:50,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:32:50,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 19:32:50,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 19:32:50,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:32:50,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:33:04,925 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-03 19:33:04,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:33:04,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270401903] [2025-03-03 19:33:04,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270401903] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:33:04,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:33:04,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-03 19:33:04,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079473530] [2025-03-03 19:33:04,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:33:04,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-03 19:33:04,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:33:04,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-03 19:33:04,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2025-03-03 19:33:04,926 INFO L87 Difference]: Start difference. First operand 254 states and 357 transitions. Second operand has 16 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-03 19:33:07,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:33:07,802 INFO L93 Difference]: Finished difference Result 473 states and 660 transitions. [2025-03-03 19:33:07,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-03 19:33:07,803 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 167 [2025-03-03 19:33:07,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:33:07,805 INFO L225 Difference]: With dead ends: 473 [2025-03-03 19:33:07,805 INFO L226 Difference]: Without dead ends: 383 [2025-03-03 19:33:07,806 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=201, Invalid=669, Unknown=0, NotChecked=0, Total=870 [2025-03-03 19:33:07,806 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 642 mSDsluCounter, 720 mSDsCounter, 0 mSdLazyCounter, 1529 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 642 SdHoareTripleChecker+Valid, 840 SdHoareTripleChecker+Invalid, 1637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 1529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-03 19:33:07,807 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [642 Valid, 840 Invalid, 1637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 1529 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-03 19:33:07,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2025-03-03 19:33:07,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 256. [2025-03-03 19:33:07,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 177 states have (on average 1.265536723163842) internal successors, (224), 178 states have internal predecessors, (224), 68 states have call successors, (68), 10 states have call predecessors, (68), 10 states have return successors, (68), 67 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-03 19:33:07,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 360 transitions. [2025-03-03 19:33:07,832 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 360 transitions. Word has length 167 [2025-03-03 19:33:07,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:33:07,832 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 360 transitions. [2025-03-03 19:33:07,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-03 19:33:07,833 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 360 transitions. [2025-03-03 19:33:07,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-03 19:33:07,834 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:33:07,834 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:33:07,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 19:33:07,834 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:33:07,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:33:07,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1372045545, now seen corresponding path program 1 times [2025-03-03 19:33:07,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:33:07,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80953200] [2025-03-03 19:33:07,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:33:07,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:33:07,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 19:33:07,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 19:33:07,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:33:07,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:33:20,600 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-03 19:33:20,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:33:20,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80953200] [2025-03-03 19:33:20,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80953200] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:33:20,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:33:20,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-03 19:33:20,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207733094] [2025-03-03 19:33:20,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:33:20,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 19:33:20,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:33:20,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 19:33:20,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2025-03-03 19:33:20,601 INFO L87 Difference]: Start difference. First operand 256 states and 360 transitions. Second operand has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 states have internal predecessors, (45), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-03 19:33:21,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:33:21,828 INFO L93 Difference]: Finished difference Result 630 states and 876 transitions. [2025-03-03 19:33:21,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 19:33:21,829 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 states have internal predecessors, (45), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 167 [2025-03-03 19:33:21,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:33:21,831 INFO L225 Difference]: With dead ends: 630 [2025-03-03 19:33:21,831 INFO L226 Difference]: Without dead ends: 540 [2025-03-03 19:33:21,832 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2025-03-03 19:33:21,832 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 631 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 641 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 631 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 19:33:21,832 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [631 Valid, 635 Invalid, 728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 641 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 19:33:21,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2025-03-03 19:33:21,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 292. [2025-03-03 19:33:21,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 205 states have (on average 1.278048780487805) internal successors, (262), 205 states have internal predecessors, (262), 75 states have call successors, (75), 11 states have call predecessors, (75), 11 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) [2025-03-03 19:33:21,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 412 transitions. [2025-03-03 19:33:21,863 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 412 transitions. Word has length 167 [2025-03-03 19:33:21,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:33:21,864 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 412 transitions. [2025-03-03 19:33:21,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 states have internal predecessors, (45), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-03 19:33:21,864 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 412 transitions. [2025-03-03 19:33:21,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-03 19:33:21,866 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:33:21,866 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:33:21,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 19:33:21,866 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:33:21,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:33:21,866 INFO L85 PathProgramCache]: Analyzing trace with hash -435408918, now seen corresponding path program 1 times [2025-03-03 19:33:21,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:33:21,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442554697] [2025-03-03 19:33:21,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:33:21,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:33:21,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 19:33:21,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 19:33:21,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:33:21,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat