./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-66.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-pe-ci_file-66.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e9f5cbcd9b5e7070eed068152e26dc672bc2b60288a251274726ceb1bf0c8d9b --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 00:51:06,614 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 00:51:06,674 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 00:51:06,681 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 00:51:06,684 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 00:51:06,706 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 00:51:06,708 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 00:51:06,708 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 00:51:06,708 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 00:51:06,708 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 00:51:06,709 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 00:51:06,709 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 00:51:06,709 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 00:51:06,709 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 00:51:06,710 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 00:51:06,710 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 00:51:06,710 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 00:51:06,710 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 00:51:06,710 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 00:51:06,710 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 00:51:06,710 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 00:51:06,710 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 00:51:06,711 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 00:51:06,711 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 00:51:06,711 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 00:51:06,711 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 00:51:06,711 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 00:51:06,711 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 00:51:06,711 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 00:51:06,711 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 00:51:06,711 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 00:51:06,711 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 00:51:06,711 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 00:51:06,712 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 00:51:06,712 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 00:51:06,712 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 00:51:06,712 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 00:51:06,712 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 00:51:06,712 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 00:51:06,712 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 00:51:06,712 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 00:51:06,713 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 00:51:06,713 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 00:51:06,713 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 -> e9f5cbcd9b5e7070eed068152e26dc672bc2b60288a251274726ceb1bf0c8d9b [2025-03-17 00:51:06,952 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 00:51:06,958 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 00:51:06,960 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 00:51:06,961 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 00:51:06,961 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 00:51:06,962 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-pe-ci_file-66.i [2025-03-17 00:51:08,172 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c3371da2/c56a688a4307406ca0956b7cbb49d331/FLAGfeb85fe49 [2025-03-17 00:51:08,467 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 00:51:08,468 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-66.i [2025-03-17 00:51:08,477 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c3371da2/c56a688a4307406ca0956b7cbb49d331/FLAGfeb85fe49 [2025-03-17 00:51:08,492 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c3371da2/c56a688a4307406ca0956b7cbb49d331 [2025-03-17 00:51:08,495 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 00:51:08,501 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 00:51:08,505 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 00:51:08,505 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 00:51:08,509 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 00:51:08,510 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:51:08" (1/1) ... [2025-03-17 00:51:08,511 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39af36f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:51:08, skipping insertion in model container [2025-03-17 00:51:08,511 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:51:08" (1/1) ... [2025-03-17 00:51:08,527 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 00:51:08,622 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-pe-ci_file-66.i[919,932] [2025-03-17 00:51:08,683 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 00:51:08,695 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 00:51:08,702 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-pe-ci_file-66.i[919,932] [2025-03-17 00:51:08,741 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 00:51:08,758 INFO L204 MainTranslator]: Completed translation [2025-03-17 00:51:08,759 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:51:08 WrapperNode [2025-03-17 00:51:08,759 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 00:51:08,760 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 00:51:08,760 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 00:51:08,760 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 00:51:08,764 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:51:08" (1/1) ... [2025-03-17 00:51:08,771 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:51:08" (1/1) ... [2025-03-17 00:51:08,800 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 177 [2025-03-17 00:51:08,801 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 00:51:08,801 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 00:51:08,801 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 00:51:08,802 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 00:51:08,807 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:51:08" (1/1) ... [2025-03-17 00:51:08,808 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:51:08" (1/1) ... [2025-03-17 00:51:08,810 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:51:08" (1/1) ... [2025-03-17 00:51:08,822 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 00:51:08,822 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:51:08" (1/1) ... [2025-03-17 00:51:08,822 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:51:08" (1/1) ... [2025-03-17 00:51:08,827 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:51:08" (1/1) ... [2025-03-17 00:51:08,834 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:51:08" (1/1) ... [2025-03-17 00:51:08,839 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:51:08" (1/1) ... [2025-03-17 00:51:08,840 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:51:08" (1/1) ... [2025-03-17 00:51:08,843 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 00:51:08,845 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 00:51:08,845 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 00:51:08,845 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 00:51:08,846 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:51:08" (1/1) ... [2025-03-17 00:51:08,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 00:51:08,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:51:08,870 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 00:51:08,872 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 00:51:08,889 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 00:51:08,889 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 00:51:08,890 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 00:51:08,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 00:51:08,890 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 00:51:08,890 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 00:51:08,942 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 00:51:08,944 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 00:51:09,284 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-17 00:51:09,284 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 00:51:09,292 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 00:51:09,292 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 00:51:09,292 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:51:09 BoogieIcfgContainer [2025-03-17 00:51:09,293 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 00:51:09,294 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 00:51:09,294 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 00:51:09,297 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 00:51:09,297 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 12:51:08" (1/3) ... [2025-03-17 00:51:09,298 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38377f84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:51:09, skipping insertion in model container [2025-03-17 00:51:09,298 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:51:08" (2/3) ... [2025-03-17 00:51:09,298 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38377f84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:51:09, skipping insertion in model container [2025-03-17 00:51:09,298 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:51:09" (3/3) ... [2025-03-17 00:51:09,299 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-66.i [2025-03-17 00:51:09,310 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 00:51:09,311 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-66.i that has 2 procedures, 75 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 00:51:09,349 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 00:51:09,361 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;@4049c8e2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 00:51:09,361 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 00:51:09,365 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 50 states have (on average 1.54) internal successors, (77), 51 states have internal predecessors, (77), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-17 00:51:09,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-17 00:51:09,374 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:51:09,375 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:51:09,375 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:51:09,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:51:09,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1920287139, now seen corresponding path program 1 times [2025-03-17 00:51:09,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:51:09,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338752287] [2025-03-17 00:51:09,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:51:09,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:51:09,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-17 00:51:09,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-17 00:51:09,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:51:09,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:51:09,912 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-17 00:51:09,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:51:09,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338752287] [2025-03-17 00:51:09,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338752287] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:51:09,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:51:09,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 00:51:09,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793056741] [2025-03-17 00:51:09,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:51:09,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 00:51:09,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:51:09,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 00:51:09,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 00:51:09,935 INFO L87 Difference]: Start difference. First operand has 75 states, 50 states have (on average 1.54) internal successors, (77), 51 states have internal predecessors, (77), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-17 00:51:10,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:51:10,080 INFO L93 Difference]: Finished difference Result 183 states and 329 transitions. [2025-03-17 00:51:10,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 00:51:10,082 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 145 [2025-03-17 00:51:10,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:51:10,088 INFO L225 Difference]: With dead ends: 183 [2025-03-17 00:51:10,088 INFO L226 Difference]: Without dead ends: 109 [2025-03-17 00:51:10,091 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 00:51:10,092 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 132 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 00:51:10,095 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 204 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 00:51:10,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-03-17 00:51:10,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 106. [2025-03-17 00:51:10,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 71 states have (on average 1.4507042253521127) internal successors, (103), 72 states have internal predecessors, (103), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-17 00:51:10,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 167 transitions. [2025-03-17 00:51:10,133 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 167 transitions. Word has length 145 [2025-03-17 00:51:10,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:51:10,134 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 167 transitions. [2025-03-17 00:51:10,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-17 00:51:10,134 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 167 transitions. [2025-03-17 00:51:10,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-17 00:51:10,137 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:51:10,138 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:51:10,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 00:51:10,138 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:51:10,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:51:10,139 INFO L85 PathProgramCache]: Analyzing trace with hash -631869822, now seen corresponding path program 1 times [2025-03-17 00:51:10,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:51:10,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460452847] [2025-03-17 00:51:10,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:51:10,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:51:10,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-17 00:51:10,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-17 00:51:10,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:51:10,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:51:10,768 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-17 00:51:10,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:51:10,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460452847] [2025-03-17 00:51:10,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460452847] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:51:10,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:51:10,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 00:51:10,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266277917] [2025-03-17 00:51:10,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:51:10,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 00:51:10,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:51:10,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 00:51:10,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 00:51:10,772 INFO L87 Difference]: Start difference. First operand 106 states and 167 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-17 00:51:11,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:51:11,268 INFO L93 Difference]: Finished difference Result 368 states and 550 transitions. [2025-03-17 00:51:11,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 00:51:11,269 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 145 [2025-03-17 00:51:11,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:51:11,275 INFO L225 Difference]: With dead ends: 368 [2025-03-17 00:51:11,276 INFO L226 Difference]: Without dead ends: 263 [2025-03-17 00:51:11,278 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-03-17 00:51:11,279 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 221 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 00:51:11,280 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 421 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 00:51:11,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2025-03-17 00:51:11,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 167. [2025-03-17 00:51:11,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 126 states have (on average 1.492063492063492) internal successors, (188), 129 states have internal predecessors, (188), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 33 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-17 00:51:11,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 260 transitions. [2025-03-17 00:51:11,313 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 260 transitions. Word has length 145 [2025-03-17 00:51:11,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:51:11,314 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 260 transitions. [2025-03-17 00:51:11,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-17 00:51:11,314 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 260 transitions. [2025-03-17 00:51:11,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-17 00:51:11,318 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:51:11,318 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:51:11,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 00:51:11,318 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:51:11,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:51:11,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1133142305, now seen corresponding path program 1 times [2025-03-17 00:51:11,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:51:11,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140174220] [2025-03-17 00:51:11,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:51:11,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:51:11,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-17 00:51:11,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-17 00:51:11,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:51:11,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:51:11,733 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-17 00:51:11,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:51:11,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140174220] [2025-03-17 00:51:11,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140174220] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:51:11,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:51:11,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 00:51:11,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359324478] [2025-03-17 00:51:11,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:51:11,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 00:51:11,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:51:11,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 00:51:11,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 00:51:11,737 INFO L87 Difference]: Start difference. First operand 167 states and 260 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-17 00:51:11,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:51:11,922 INFO L93 Difference]: Finished difference Result 618 states and 957 transitions. [2025-03-17 00:51:11,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 00:51:11,922 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 146 [2025-03-17 00:51:11,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:51:11,927 INFO L225 Difference]: With dead ends: 618 [2025-03-17 00:51:11,928 INFO L226 Difference]: Without dead ends: 452 [2025-03-17 00:51:11,929 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 00:51:11,930 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 185 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 00:51:11,930 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 238 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 00:51:11,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2025-03-17 00:51:11,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 379. [2025-03-17 00:51:11,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 308 states have (on average 1.5129870129870129) internal successors, (466), 315 states have internal predecessors, (466), 62 states have call successors, (62), 8 states have call predecessors, (62), 8 states have return successors, (62), 55 states have call predecessors, (62), 62 states have call successors, (62) [2025-03-17 00:51:11,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 590 transitions. [2025-03-17 00:51:11,992 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 590 transitions. Word has length 146 [2025-03-17 00:51:11,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:51:11,993 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 590 transitions. [2025-03-17 00:51:11,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-17 00:51:11,993 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 590 transitions. [2025-03-17 00:51:11,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-17 00:51:11,995 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:51:11,995 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:51:11,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 00:51:11,995 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:51:11,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:51:11,998 INFO L85 PathProgramCache]: Analyzing trace with hash 936628800, now seen corresponding path program 1 times [2025-03-17 00:51:11,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:51:11,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351565034] [2025-03-17 00:51:11,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:51:11,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:51:12,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-17 00:51:12,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-17 00:51:12,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:51:12,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:51:17,285 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-17 00:51:17,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:51:17,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351565034] [2025-03-17 00:51:17,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351565034] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:51:17,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:51:17,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-17 00:51:17,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068478500] [2025-03-17 00:51:17,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:51:17,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-17 00:51:17,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:51:17,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-17 00:51:17,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2025-03-17 00:51:17,287 INFO L87 Difference]: Start difference. First operand 379 states and 590 transitions. Second operand has 17 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 17 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-17 00:51:21,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:51:21,992 INFO L93 Difference]: Finished difference Result 1681 states and 2580 transitions. [2025-03-17 00:51:21,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-17 00:51:21,993 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 17 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 146 [2025-03-17 00:51:21,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:51:21,998 INFO L225 Difference]: With dead ends: 1681 [2025-03-17 00:51:21,998 INFO L226 Difference]: Without dead ends: 1303 [2025-03-17 00:51:21,999 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=455, Invalid=1105, Unknown=0, NotChecked=0, Total=1560 [2025-03-17 00:51:22,000 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 872 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 1517 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 872 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 1558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-17 00:51:22,000 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [872 Valid, 655 Invalid, 1558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1517 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-17 00:51:22,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1303 states. [2025-03-17 00:51:22,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1303 to 793. [2025-03-17 00:51:22,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 793 states, 690 states have (on average 1.527536231884058) internal successors, (1054), 705 states have internal predecessors, (1054), 86 states have call successors, (86), 16 states have call predecessors, (86), 16 states have return successors, (86), 71 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-17 00:51:22,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 1226 transitions. [2025-03-17 00:51:22,047 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 1226 transitions. Word has length 146 [2025-03-17 00:51:22,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:51:22,047 INFO L471 AbstractCegarLoop]: Abstraction has 793 states and 1226 transitions. [2025-03-17 00:51:22,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 17 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-17 00:51:22,047 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 1226 transitions. [2025-03-17 00:51:22,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-17 00:51:22,049 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:51:22,049 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:51:22,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 00:51:22,049 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:51:22,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:51:22,050 INFO L85 PathProgramCache]: Analyzing trace with hash 374498178, now seen corresponding path program 1 times [2025-03-17 00:51:22,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:51:22,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937542078] [2025-03-17 00:51:22,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:51:22,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:51:22,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-17 00:51:22,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-17 00:51:22,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:51:22,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:51:58,077 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-17 00:51:58,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:51:58,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937542078] [2025-03-17 00:51:58,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937542078] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:51:58,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:51:58,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-17 00:51:58,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623302430] [2025-03-17 00:51:58,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:51:58,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 00:51:58,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:51:58,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 00:51:58,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2025-03-17 00:51:58,079 INFO L87 Difference]: Start difference. First operand 793 states and 1226 transitions. Second operand has 16 states, 16 states have (on average 2.4375) internal successors, (39), 16 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-17 00:51:59,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:51:59,628 INFO L93 Difference]: Finished difference Result 1129 states and 1699 transitions. [2025-03-17 00:51:59,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 00:51:59,628 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.4375) internal successors, (39), 16 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 146 [2025-03-17 00:51:59,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:51:59,633 INFO L225 Difference]: With dead ends: 1129 [2025-03-17 00:51:59,633 INFO L226 Difference]: Without dead ends: 1127 [2025-03-17 00:51:59,633 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=103, Invalid=169, Unknown=0, NotChecked=0, Total=272 [2025-03-17 00:51:59,634 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 300 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 657 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-17 00:51:59,634 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 508 Invalid, 659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 657 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-17 00:51:59,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1127 states. [2025-03-17 00:51:59,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1127 to 991. [2025-03-17 00:51:59,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 991 states, 844 states have (on average 1.509478672985782) internal successors, (1274), 867 states have internal predecessors, (1274), 118 states have call successors, (118), 28 states have call predecessors, (118), 28 states have return successors, (118), 95 states have call predecessors, (118), 118 states have call successors, (118) [2025-03-17 00:51:59,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 991 states and 1510 transitions. [2025-03-17 00:51:59,703 INFO L78 Accepts]: Start accepts. Automaton has 991 states and 1510 transitions. Word has length 146 [2025-03-17 00:51:59,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:51:59,703 INFO L471 AbstractCegarLoop]: Abstraction has 991 states and 1510 transitions. [2025-03-17 00:51:59,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.4375) internal successors, (39), 16 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-17 00:51:59,704 INFO L276 IsEmpty]: Start isEmpty. Operand 991 states and 1510 transitions. [2025-03-17 00:51:59,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-17 00:51:59,706 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:51:59,706 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:51:59,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 00:51:59,706 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:51:59,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:51:59,707 INFO L85 PathProgramCache]: Analyzing trace with hash 807546081, now seen corresponding path program 1 times [2025-03-17 00:51:59,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:51:59,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236240424] [2025-03-17 00:51:59,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:51:59,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:51:59,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-17 00:51:59,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-17 00:51:59,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:51:59,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:52:03,568 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-17 00:52:03,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:52:03,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236240424] [2025-03-17 00:52:03,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236240424] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:52:03,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:52:03,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-17 00:52:03,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984150556] [2025-03-17 00:52:03,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:52:03,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 00:52:03,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:52:03,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 00:52:03,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2025-03-17 00:52:03,569 INFO L87 Difference]: Start difference. First operand 991 states and 1510 transitions. Second operand has 16 states, 16 states have (on average 2.4375) internal successors, (39), 16 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-17 00:52:06,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:52:06,809 INFO L93 Difference]: Finished difference Result 1287 states and 1930 transitions. [2025-03-17 00:52:06,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-17 00:52:06,810 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.4375) internal successors, (39), 16 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 146 [2025-03-17 00:52:06,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:52:06,817 INFO L225 Difference]: With dead ends: 1287 [2025-03-17 00:52:06,817 INFO L226 Difference]: Without dead ends: 1285 [2025-03-17 00:52:06,818 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=190, Invalid=460, Unknown=0, NotChecked=0, Total=650 [2025-03-17 00:52:06,819 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 571 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 980 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 571 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 998 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 980 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-17 00:52:06,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [571 Valid, 624 Invalid, 998 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 980 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-17 00:52:06,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1285 states. [2025-03-17 00:52:06,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1285 to 990. [2025-03-17 00:52:06,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 990 states, 843 states have (on average 1.508896797153025) internal successors, (1272), 866 states have internal predecessors, (1272), 118 states have call successors, (118), 28 states have call predecessors, (118), 28 states have return successors, (118), 95 states have call predecessors, (118), 118 states have call successors, (118) [2025-03-17 00:52:06,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 990 states to 990 states and 1508 transitions. [2025-03-17 00:52:06,883 INFO L78 Accepts]: Start accepts. Automaton has 990 states and 1508 transitions. Word has length 146 [2025-03-17 00:52:06,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:52:06,883 INFO L471 AbstractCegarLoop]: Abstraction has 990 states and 1508 transitions. [2025-03-17 00:52:06,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.4375) internal successors, (39), 16 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-17 00:52:06,883 INFO L276 IsEmpty]: Start isEmpty. Operand 990 states and 1508 transitions. [2025-03-17 00:52:06,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-17 00:52:06,886 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:52:06,887 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:52:06,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 00:52:06,887 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:52:06,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:52:06,888 INFO L85 PathProgramCache]: Analyzing trace with hash 426094623, now seen corresponding path program 1 times [2025-03-17 00:52:06,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:52:06,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189808] [2025-03-17 00:52:06,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:52:06,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:52:06,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-17 00:52:06,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-17 00:52:06,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:52:06,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:52:12,610 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-17 00:52:12,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:52:12,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189808] [2025-03-17 00:52:12,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189808] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:52:12,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:52:12,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-17 00:52:12,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705712615] [2025-03-17 00:52:12,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:52:12,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 00:52:12,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:52:12,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 00:52:12,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2025-03-17 00:52:12,612 INFO L87 Difference]: Start difference. First operand 990 states and 1508 transitions. Second operand has 16 states, 16 states have (on average 2.4375) internal successors, (39), 16 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-17 00:52:14,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:52:14,154 INFO L93 Difference]: Finished difference Result 1187 states and 1788 transitions. [2025-03-17 00:52:14,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 00:52:14,155 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.4375) internal successors, (39), 16 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 146 [2025-03-17 00:52:14,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:52:14,159 INFO L225 Difference]: With dead ends: 1187 [2025-03-17 00:52:14,159 INFO L226 Difference]: Without dead ends: 1185 [2025-03-17 00:52:14,160 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=102, Invalid=204, Unknown=0, NotChecked=0, Total=306 [2025-03-17 00:52:14,160 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 456 mSDsluCounter, 630 mSDsCounter, 0 mSdLazyCounter, 1160 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 738 SdHoareTripleChecker+Invalid, 1177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-17 00:52:14,160 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [456 Valid, 738 Invalid, 1177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1160 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-17 00:52:14,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1185 states. [2025-03-17 00:52:14,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1185 to 994. [2025-03-17 00:52:14,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 994 states, 847 states have (on average 1.5100354191263283) internal successors, (1279), 870 states have internal predecessors, (1279), 118 states have call successors, (118), 28 states have call predecessors, (118), 28 states have return successors, (118), 95 states have call predecessors, (118), 118 states have call successors, (118) [2025-03-17 00:52:14,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 1515 transitions. [2025-03-17 00:52:14,219 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 1515 transitions. Word has length 146 [2025-03-17 00:52:14,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:52:14,219 INFO L471 AbstractCegarLoop]: Abstraction has 994 states and 1515 transitions. [2025-03-17 00:52:14,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.4375) internal successors, (39), 16 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-17 00:52:14,220 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1515 transitions. [2025-03-17 00:52:14,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-17 00:52:14,221 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:52:14,221 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:52:14,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 00:52:14,222 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:52:14,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:52:14,222 INFO L85 PathProgramCache]: Analyzing trace with hash -136035999, now seen corresponding path program 1 times [2025-03-17 00:52:14,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:52:14,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917362580] [2025-03-17 00:52:14,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:52:14,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:52:14,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-17 00:52:14,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-17 00:52:14,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:52:14,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:52:20,338 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-17 00:52:20,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:52:20,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917362580] [2025-03-17 00:52:20,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917362580] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:52:20,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:52:20,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-17 00:52:20,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690871805] [2025-03-17 00:52:20,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:52:20,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 00:52:20,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:52:20,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 00:52:20,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2025-03-17 00:52:20,340 INFO L87 Difference]: Start difference. First operand 994 states and 1515 transitions. Second operand has 16 states, 16 states have (on average 2.4375) internal successors, (39), 16 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-17 00:52:22,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:52:22,722 INFO L93 Difference]: Finished difference Result 1195 states and 1795 transitions. [2025-03-17 00:52:22,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 00:52:22,722 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.4375) internal successors, (39), 16 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 146 [2025-03-17 00:52:22,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:52:22,727 INFO L225 Difference]: With dead ends: 1195 [2025-03-17 00:52:22,727 INFO L226 Difference]: Without dead ends: 1193 [2025-03-17 00:52:22,728 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2025-03-17 00:52:22,728 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 411 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 810 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 411 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-17 00:52:22,728 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [411 Valid, 564 Invalid, 810 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 810 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-17 00:52:22,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2025-03-17 00:52:22,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 993. [2025-03-17 00:52:22,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 993 states, 846 states have (on average 1.5094562647754137) internal successors, (1277), 869 states have internal predecessors, (1277), 118 states have call successors, (118), 28 states have call predecessors, (118), 28 states have return successors, (118), 95 states have call predecessors, (118), 118 states have call successors, (118) [2025-03-17 00:52:22,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 993 states to 993 states and 1513 transitions. [2025-03-17 00:52:22,786 INFO L78 Accepts]: Start accepts. Automaton has 993 states and 1513 transitions. Word has length 146 [2025-03-17 00:52:22,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:52:22,787 INFO L471 AbstractCegarLoop]: Abstraction has 993 states and 1513 transitions. [2025-03-17 00:52:22,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.4375) internal successors, (39), 16 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-17 00:52:22,787 INFO L276 IsEmpty]: Start isEmpty. Operand 993 states and 1513 transitions. [2025-03-17 00:52:22,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-17 00:52:22,789 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:52:22,789 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:52:22,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 00:52:22,789 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:52:22,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:52:22,790 INFO L85 PathProgramCache]: Analyzing trace with hash 297011904, now seen corresponding path program 1 times [2025-03-17 00:52:22,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:52:22,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946988190] [2025-03-17 00:52:22,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:52:22,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:52:22,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-17 00:52:22,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-17 00:52:22,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:52:22,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:52:27,526 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-17 00:52:27,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:52:27,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946988190] [2025-03-17 00:52:27,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946988190] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:52:27,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:52:27,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-17 00:52:27,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730129328] [2025-03-17 00:52:27,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:52:27,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 00:52:27,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:52:27,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 00:52:27,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2025-03-17 00:52:27,528 INFO L87 Difference]: Start difference. First operand 993 states and 1513 transitions. Second operand has 16 states, 16 states have (on average 2.4375) internal successors, (39), 16 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-17 00:52:30,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:52:30,744 INFO L93 Difference]: Finished difference Result 1303 states and 1956 transitions. [2025-03-17 00:52:30,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-17 00:52:30,745 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.4375) internal successors, (39), 16 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 146 [2025-03-17 00:52:30,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:52:30,748 INFO L225 Difference]: With dead ends: 1303 [2025-03-17 00:52:30,748 INFO L226 Difference]: Without dead ends: 1301 [2025-03-17 00:52:30,749 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=190, Invalid=460, Unknown=0, NotChecked=0, Total=650 [2025-03-17 00:52:30,749 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 473 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 1262 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 473 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 1280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-17 00:52:30,749 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [473 Valid, 638 Invalid, 1280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1262 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-17 00:52:30,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1301 states. [2025-03-17 00:52:30,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1301 to 994. [2025-03-17 00:52:30,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 994 states, 847 states have (on average 1.5100354191263283) internal successors, (1279), 870 states have internal predecessors, (1279), 118 states have call successors, (118), 28 states have call predecessors, (118), 28 states have return successors, (118), 95 states have call predecessors, (118), 118 states have call successors, (118) [2025-03-17 00:52:30,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 1515 transitions. [2025-03-17 00:52:30,804 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 1515 transitions. Word has length 146 [2025-03-17 00:52:30,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:52:30,804 INFO L471 AbstractCegarLoop]: Abstraction has 994 states and 1515 transitions. [2025-03-17 00:52:30,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.4375) internal successors, (39), 16 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-17 00:52:30,804 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1515 transitions. [2025-03-17 00:52:30,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-17 00:52:30,805 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:52:30,805 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:52:30,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 00:52:30,806 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:52:30,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:52:30,806 INFO L85 PathProgramCache]: Analyzing trace with hash -265118718, now seen corresponding path program 1 times [2025-03-17 00:52:30,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:52:30,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796041212] [2025-03-17 00:52:30,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:52:30,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:52:30,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-17 00:52:30,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-17 00:52:30,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:52:30,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:52:37,972 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-17 00:52:37,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:52:37,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796041212] [2025-03-17 00:52:37,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796041212] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:52:37,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:52:37,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-17 00:52:37,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448079336] [2025-03-17 00:52:37,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:52:37,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 00:52:37,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:52:37,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 00:52:37,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2025-03-17 00:52:37,974 INFO L87 Difference]: Start difference. First operand 994 states and 1515 transitions. Second operand has 16 states, 16 states have (on average 2.4375) internal successors, (39), 16 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-17 00:52:40,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:52:40,054 INFO L93 Difference]: Finished difference Result 1201 states and 1802 transitions. [2025-03-17 00:52:40,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 00:52:40,055 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.4375) internal successors, (39), 16 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 146 [2025-03-17 00:52:40,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:52:40,058 INFO L225 Difference]: With dead ends: 1201 [2025-03-17 00:52:40,058 INFO L226 Difference]: Without dead ends: 1199 [2025-03-17 00:52:40,059 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2025-03-17 00:52:40,059 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 512 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 963 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 512 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 963 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-17 00:52:40,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [512 Valid, 513 Invalid, 975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 963 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-17 00:52:40,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1199 states. [2025-03-17 00:52:40,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1199 to 991. [2025-03-17 00:52:40,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 991 states, 844 states have (on average 1.509478672985782) internal successors, (1274), 867 states have internal predecessors, (1274), 118 states have call successors, (118), 28 states have call predecessors, (118), 28 states have return successors, (118), 95 states have call predecessors, (118), 118 states have call successors, (118) [2025-03-17 00:52:40,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 991 states and 1510 transitions. [2025-03-17 00:52:40,117 INFO L78 Accepts]: Start accepts. Automaton has 991 states and 1510 transitions. Word has length 146 [2025-03-17 00:52:40,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:52:40,118 INFO L471 AbstractCegarLoop]: Abstraction has 991 states and 1510 transitions. [2025-03-17 00:52:40,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.4375) internal successors, (39), 16 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-17 00:52:40,118 INFO L276 IsEmpty]: Start isEmpty. Operand 991 states and 1510 transitions. [2025-03-17 00:52:40,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-17 00:52:40,120 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:52:40,120 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:52:40,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 00:52:40,120 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:52:40,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:52:40,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1109233022, now seen corresponding path program 1 times [2025-03-17 00:52:40,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:52:40,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61427407] [2025-03-17 00:52:40,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:52:40,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:52:40,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-17 00:52:40,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-17 00:52:40,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:52:40,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat