./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-53.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-53.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 7cb9b30dbc4292cb9b2a5d2ba3cd92c29fce78cf71613b08638f29c6cc332119 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:12:27,809 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:12:27,866 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 00:12:27,871 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:12:27,871 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:12:27,888 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:12:27,889 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:12:27,890 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:12:27,890 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:12:27,890 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:12:27,891 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:12:27,891 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:12:27,891 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:12:27,891 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:12:27,891 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:12:27,892 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:12:27,892 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:12:27,892 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:12:27,892 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 00:12:27,892 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:12:27,892 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:12:27,892 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:12:27,892 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:12:27,893 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:12:27,893 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:12:27,893 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:12:27,893 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:12:27,893 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:12:27,893 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:12:27,893 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:12:27,893 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:12:27,893 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:12:27,893 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:12:27,894 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:12:27,894 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:12:27,894 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:12:27,894 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:12:27,894 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 00:12:27,894 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 00:12:27,894 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:12:27,894 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:12:27,894 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:12:27,894 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:12:27,895 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 -> 7cb9b30dbc4292cb9b2a5d2ba3cd92c29fce78cf71613b08638f29c6cc332119 [2025-03-04 00:12:28,120 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:12:28,128 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:12:28,131 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:12:28,132 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:12:28,132 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:12:28,133 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-53.i [2025-03-04 00:12:29,298 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a254870da/411a193e28ef4ff19ca9ae5f29dc60a5/FLAG4a08a3de9 [2025-03-04 00:12:29,563 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:12:29,564 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-53.i [2025-03-04 00:12:29,571 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a254870da/411a193e28ef4ff19ca9ae5f29dc60a5/FLAG4a08a3de9 [2025-03-04 00:12:29,860 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a254870da/411a193e28ef4ff19ca9ae5f29dc60a5 [2025-03-04 00:12:29,862 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:12:29,862 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:12:29,863 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:12:29,863 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:12:29,866 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:12:29,867 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:12:29" (1/1) ... [2025-03-04 00:12:29,867 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3750e0b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:12:29, skipping insertion in model container [2025-03-04 00:12:29,867 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:12:29" (1/1) ... [2025-03-04 00:12:29,893 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:12:29,985 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_operatoramount_amount250_file-53.i[916,929] [2025-03-04 00:12:30,066 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:12:30,079 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:12:30,086 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_operatoramount_amount250_file-53.i[916,929] [2025-03-04 00:12:30,143 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:12:30,159 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:12:30,159 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:12:30 WrapperNode [2025-03-04 00:12:30,160 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:12:30,161 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:12:30,161 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:12:30,161 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:12:30,165 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:12:30" (1/1) ... [2025-03-04 00:12:30,181 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:12:30" (1/1) ... [2025-03-04 00:12:30,226 INFO L138 Inliner]: procedures = 26, calls = 58, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 409 [2025-03-04 00:12:30,227 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:12:30,227 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:12:30,227 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:12:30,227 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:12:30,233 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:12:30" (1/1) ... [2025-03-04 00:12:30,233 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:12:30" (1/1) ... [2025-03-04 00:12:30,245 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:12:30" (1/1) ... [2025-03-04 00:12:30,278 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-04 00:12:30,279 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:12:30" (1/1) ... [2025-03-04 00:12:30,279 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:12:30" (1/1) ... [2025-03-04 00:12:30,291 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:12:30" (1/1) ... [2025-03-04 00:12:30,294 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:12:30" (1/1) ... [2025-03-04 00:12:30,296 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:12:30" (1/1) ... [2025-03-04 00:12:30,302 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:12:30" (1/1) ... [2025-03-04 00:12:30,315 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:12:30,317 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:12:30,317 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:12:30,317 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:12:30,318 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:12:30" (1/1) ... [2025-03-04 00:12:30,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:12:30,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:12:30,345 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-04 00:12:30,348 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-04 00:12:30,367 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:12:30,368 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:12:30,368 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:12:30,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 00:12:30,368 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:12:30,368 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:12:30,437 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:12:30,438 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:12:31,023 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L376: havoc property_#t~ite36#1;havoc property_#t~bitwise35#1;havoc property_#t~short37#1;havoc property_#t~ite39#1;havoc property_#t~bitwise38#1;havoc property_#t~short40#1; [2025-03-04 00:12:31,082 INFO L? ?]: Removed 54 outVars from TransFormulas that were not future-live. [2025-03-04 00:12:31,082 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:12:31,100 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:12:31,103 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-04 00:12:31,103 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:12:31 BoogieIcfgContainer [2025-03-04 00:12:31,103 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:12:31,105 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:12:31,105 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:12:31,109 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:12:31,109 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:12:29" (1/3) ... [2025-03-04 00:12:31,110 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35018037 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:12:31, skipping insertion in model container [2025-03-04 00:12:31,110 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:12:30" (2/3) ... [2025-03-04 00:12:31,110 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35018037 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:12:31, skipping insertion in model container [2025-03-04 00:12:31,111 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:12:31" (3/3) ... [2025-03-04 00:12:31,112 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-53.i [2025-03-04 00:12:31,122 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:12:31,126 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount250_file-53.i that has 2 procedures, 168 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:12:31,172 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:12:31,181 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;@60a1c7ae, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:12:31,182 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:12:31,185 INFO L276 IsEmpty]: Start isEmpty. Operand has 168 states, 120 states have (on average 1.475) internal successors, (177), 121 states have internal predecessors, (177), 45 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2025-03-04 00:12:31,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2025-03-04 00:12:31,202 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:12:31,203 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:12:31,204 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:12:31,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:12:31,207 INFO L85 PathProgramCache]: Analyzing trace with hash 209240578, now seen corresponding path program 1 times [2025-03-04 00:12:31,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:12:31,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955259664] [2025-03-04 00:12:31,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:12:31,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:12:31,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 305 statements into 1 equivalence classes. [2025-03-04 00:12:31,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 305 of 305 statements. [2025-03-04 00:12:31,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:12:31,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:12:31,614 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 0 proven. 88 refuted. 0 times theorem prover too weak. 3872 trivial. 0 not checked. [2025-03-04 00:12:31,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:12:31,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955259664] [2025-03-04 00:12:31,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955259664] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:12:31,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [549288288] [2025-03-04 00:12:31,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:12:31,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:12:31,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:12:31,619 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:12:31,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 00:12:31,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 305 statements into 1 equivalence classes. [2025-03-04 00:12:31,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 305 of 305 statements. [2025-03-04 00:12:31,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:12:31,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:12:31,854 INFO L256 TraceCheckSpWp]: Trace formula consists of 749 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:12:31,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:12:31,887 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 3872 trivial. 0 not checked. [2025-03-04 00:12:31,888 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:12:31,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [549288288] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:12:31,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:12:31,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 00:12:31,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939913093] [2025-03-04 00:12:31,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:12:31,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:12:31,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:12:31,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:12:31,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:12:31,909 INFO L87 Difference]: Start difference. First operand has 168 states, 120 states have (on average 1.475) internal successors, (177), 121 states have internal predecessors, (177), 45 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) Second operand has 2 states, 2 states have (on average 42.5) internal successors, (85), 2 states have internal predecessors, (85), 2 states have call successors, (45), 2 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 2 states have call successors, (45) [2025-03-04 00:12:31,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:12:31,954 INFO L93 Difference]: Finished difference Result 328 states and 570 transitions. [2025-03-04 00:12:31,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:12:31,956 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 42.5) internal successors, (85), 2 states have internal predecessors, (85), 2 states have call successors, (45), 2 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 2 states have call successors, (45) Word has length 305 [2025-03-04 00:12:31,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:12:31,961 INFO L225 Difference]: With dead ends: 328 [2025-03-04 00:12:31,961 INFO L226 Difference]: Without dead ends: 163 [2025-03-04 00:12:31,964 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 306 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:12:31,966 INFO L435 NwaCegarLoop]: 253 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:12:31,966 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 253 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:12:31,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2025-03-04 00:12:31,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2025-03-04 00:12:31,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 116 states have (on average 1.4396551724137931) internal successors, (167), 116 states have internal predecessors, (167), 45 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2025-03-04 00:12:32,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 257 transitions. [2025-03-04 00:12:32,006 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 257 transitions. Word has length 305 [2025-03-04 00:12:32,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:12:32,006 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 257 transitions. [2025-03-04 00:12:32,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 42.5) internal successors, (85), 2 states have internal predecessors, (85), 2 states have call successors, (45), 2 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 2 states have call successors, (45) [2025-03-04 00:12:32,007 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 257 transitions. [2025-03-04 00:12:32,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2025-03-04 00:12:32,013 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:12:32,014 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:12:32,021 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 00:12:32,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-04 00:12:32,218 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:12:32,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:12:32,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1217101885, now seen corresponding path program 1 times [2025-03-04 00:12:32,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:12:32,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169643956] [2025-03-04 00:12:32,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:12:32,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:12:32,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 305 statements into 1 equivalence classes. [2025-03-04 00:12:32,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 305 of 305 statements. [2025-03-04 00:12:32,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:12:32,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:12:32,524 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2025-03-04 00:12:32,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:12:32,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169643956] [2025-03-04 00:12:32,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169643956] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:12:32,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:12:32,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:12:32,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501846193] [2025-03-04 00:12:32,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:12:32,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:12:32,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:12:32,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:12:32,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:12:32,529 INFO L87 Difference]: Start difference. First operand 163 states and 257 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-03-04 00:12:32,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:12:32,633 INFO L93 Difference]: Finished difference Result 472 states and 745 transitions. [2025-03-04 00:12:32,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:12:32,634 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) Word has length 305 [2025-03-04 00:12:32,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:12:32,640 INFO L225 Difference]: With dead ends: 472 [2025-03-04 00:12:32,641 INFO L226 Difference]: Without dead ends: 312 [2025-03-04 00:12:32,643 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:12:32,644 INFO L435 NwaCegarLoop]: 466 mSDtfsCounter, 233 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 693 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:12:32,644 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 693 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:12:32,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2025-03-04 00:12:32,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 182. [2025-03-04 00:12:32,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 135 states have (on average 1.451851851851852) internal successors, (196), 135 states have internal predecessors, (196), 45 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2025-03-04 00:12:32,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 286 transitions. [2025-03-04 00:12:32,674 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 286 transitions. Word has length 305 [2025-03-04 00:12:32,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:12:32,678 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 286 transitions. [2025-03-04 00:12:32,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-03-04 00:12:32,678 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 286 transitions. [2025-03-04 00:12:32,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2025-03-04 00:12:32,685 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:12:32,685 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:12:32,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 00:12:32,686 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:12:32,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:12:32,686 INFO L85 PathProgramCache]: Analyzing trace with hash 246517314, now seen corresponding path program 1 times [2025-03-04 00:12:32,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:12:32,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522914311] [2025-03-04 00:12:32,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:12:32,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:12:32,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 305 statements into 1 equivalence classes. [2025-03-04 00:12:32,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 305 of 305 statements. [2025-03-04 00:12:32,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:12:32,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:12:33,197 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2025-03-04 00:12:33,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:12:33,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522914311] [2025-03-04 00:12:33,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522914311] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:12:33,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:12:33,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 00:12:33,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80136488] [2025-03-04 00:12:33,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:12:33,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 00:12:33,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:12:33,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 00:12:33,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:12:33,202 INFO L87 Difference]: Start difference. First operand 182 states and 286 transitions. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-03-04 00:12:33,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:12:33,508 INFO L93 Difference]: Finished difference Result 482 states and 754 transitions. [2025-03-04 00:12:33,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 00:12:33,508 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) Word has length 305 [2025-03-04 00:12:33,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:12:33,511 INFO L225 Difference]: With dead ends: 482 [2025-03-04 00:12:33,511 INFO L226 Difference]: Without dead ends: 303 [2025-03-04 00:12:33,513 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 00:12:33,515 INFO L435 NwaCegarLoop]: 416 mSDtfsCounter, 179 mSDsluCounter, 854 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 1270 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:12:33,515 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 1270 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 00:12:33,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2025-03-04 00:12:33,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 186. [2025-03-04 00:12:33,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 139 states have (on average 1.4388489208633093) internal successors, (200), 139 states have internal predecessors, (200), 45 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2025-03-04 00:12:33,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 290 transitions. [2025-03-04 00:12:33,531 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 290 transitions. Word has length 305 [2025-03-04 00:12:33,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:12:33,531 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 290 transitions. [2025-03-04 00:12:33,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-03-04 00:12:33,532 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 290 transitions. [2025-03-04 00:12:33,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2025-03-04 00:12:33,534 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:12:33,534 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:12:33,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 00:12:33,535 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:12:33,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:12:33,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1550434045, now seen corresponding path program 1 times [2025-03-04 00:12:33,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:12:33,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047312333] [2025-03-04 00:12:33,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:12:33,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:12:33,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 305 statements into 1 equivalence classes. [2025-03-04 00:12:33,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 305 of 305 statements. [2025-03-04 00:12:33,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:12:33,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:12:34,737 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2025-03-04 00:12:34,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:12:34,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047312333] [2025-03-04 00:12:34,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047312333] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:12:34,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:12:34,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 00:12:34,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628948374] [2025-03-04 00:12:34,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:12:34,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 00:12:34,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:12:34,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 00:12:34,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 00:12:34,739 INFO L87 Difference]: Start difference. First operand 186 states and 290 transitions. Second operand has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 2 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) [2025-03-04 00:12:35,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:12:35,288 INFO L93 Difference]: Finished difference Result 661 states and 1033 transitions. [2025-03-04 00:12:35,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 00:12:35,288 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 2 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) Word has length 305 [2025-03-04 00:12:35,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:12:35,292 INFO L225 Difference]: With dead ends: 661 [2025-03-04 00:12:35,292 INFO L226 Difference]: Without dead ends: 478 [2025-03-04 00:12:35,292 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2025-03-04 00:12:35,293 INFO L435 NwaCegarLoop]: 265 mSDtfsCounter, 586 mSDsluCounter, 777 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 216 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 586 SdHoareTripleChecker+Valid, 1042 SdHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 216 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 00:12:35,293 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [586 Valid, 1042 Invalid, 505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [216 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 00:12:35,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2025-03-04 00:12:35,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 299. [2025-03-04 00:12:35,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 206 states have (on average 1.4077669902912622) internal successors, (290), 206 states have internal predecessors, (290), 90 states have call successors, (90), 2 states have call predecessors, (90), 2 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) [2025-03-04 00:12:35,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 470 transitions. [2025-03-04 00:12:35,329 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 470 transitions. Word has length 305 [2025-03-04 00:12:35,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:12:35,331 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 470 transitions. [2025-03-04 00:12:35,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 2 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) [2025-03-04 00:12:35,331 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 470 transitions. [2025-03-04 00:12:35,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2025-03-04 00:12:35,334 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:12:35,334 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:12:35,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 00:12:35,334 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:12:35,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:12:35,336 INFO L85 PathProgramCache]: Analyzing trace with hash 706476962, now seen corresponding path program 1 times [2025-03-04 00:12:35,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:12:35,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66371277] [2025-03-04 00:12:35,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:12:35,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:12:35,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 305 statements into 1 equivalence classes. [2025-03-04 00:12:35,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 305 of 305 statements. [2025-03-04 00:12:35,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:12:35,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:12:36,146 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2025-03-04 00:12:36,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:12:36,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66371277] [2025-03-04 00:12:36,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66371277] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:12:36,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [260003928] [2025-03-04 00:12:36,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:12:36,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:12:36,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:12:36,148 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:12:36,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 00:12:36,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 305 statements into 1 equivalence classes. [2025-03-04 00:12:36,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 305 of 305 statements. [2025-03-04 00:12:36,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:12:36,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:12:36,332 INFO L256 TraceCheckSpWp]: Trace formula consists of 743 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 00:12:36,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:12:37,173 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 1836 proven. 132 refuted. 0 times theorem prover too weak. 1992 trivial. 0 not checked. [2025-03-04 00:12:37,173 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:12:37,555 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2025-03-04 00:12:37,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [260003928] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:12:37,556 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:12:37,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-03-04 00:12:37,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262672800] [2025-03-04 00:12:37,556 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:12:37,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 00:12:37,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:12:37,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 00:12:37,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2025-03-04 00:12:37,558 INFO L87 Difference]: Start difference. First operand 299 states and 470 transitions. Second operand has 13 states, 13 states have (on average 13.153846153846153) internal successors, (171), 13 states have internal predecessors, (171), 5 states have call successors, (117), 3 states have call predecessors, (117), 5 states have return successors, (118), 4 states have call predecessors, (118), 5 states have call successors, (118) [2025-03-04 00:12:38,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:12:38,087 INFO L93 Difference]: Finished difference Result 692 states and 1059 transitions. [2025-03-04 00:12:38,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 00:12:38,088 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 13.153846153846153) internal successors, (171), 13 states have internal predecessors, (171), 5 states have call successors, (117), 3 states have call predecessors, (117), 5 states have return successors, (118), 4 states have call predecessors, (118), 5 states have call successors, (118) Word has length 305 [2025-03-04 00:12:38,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:12:38,091 INFO L225 Difference]: With dead ends: 692 [2025-03-04 00:12:38,091 INFO L226 Difference]: Without dead ends: 501 [2025-03-04 00:12:38,091 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 625 GetRequests, 605 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=125, Invalid=295, Unknown=0, NotChecked=0, Total=420 [2025-03-04 00:12:38,092 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 875 mSDsluCounter, 607 mSDsCounter, 0 mSdLazyCounter, 705 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 875 SdHoareTripleChecker+Valid, 787 SdHoareTripleChecker+Invalid, 715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 00:12:38,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [875 Valid, 787 Invalid, 715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 705 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 00:12:38,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2025-03-04 00:12:38,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 317. [2025-03-04 00:12:38,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 220 states have (on average 1.3818181818181818) internal successors, (304), 220 states have internal predecessors, (304), 90 states have call successors, (90), 6 states have call predecessors, (90), 6 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) [2025-03-04 00:12:38,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 484 transitions. [2025-03-04 00:12:38,115 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 484 transitions. Word has length 305 [2025-03-04 00:12:38,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:12:38,116 INFO L471 AbstractCegarLoop]: Abstraction has 317 states and 484 transitions. [2025-03-04 00:12:38,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 13.153846153846153) internal successors, (171), 13 states have internal predecessors, (171), 5 states have call successors, (117), 3 states have call predecessors, (117), 5 states have return successors, (118), 4 states have call predecessors, (118), 5 states have call successors, (118) [2025-03-04 00:12:38,116 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 484 transitions. [2025-03-04 00:12:38,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2025-03-04 00:12:38,118 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:12:38,118 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:12:38,126 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 00:12:38,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:12:38,323 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:12:38,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:12:38,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1399578659, now seen corresponding path program 1 times [2025-03-04 00:12:38,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:12:38,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785496982] [2025-03-04 00:12:38,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:12:38,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:12:38,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 305 statements into 1 equivalence classes. [2025-03-04 00:12:39,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 305 of 305 statements. [2025-03-04 00:12:39,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:12:39,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:12:39,425 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 33 proven. 99 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2025-03-04 00:12:39,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:12:39,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785496982] [2025-03-04 00:12:39,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785496982] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:12:39,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1474898312] [2025-03-04 00:12:39,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:12:39,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:12:39,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:12:39,428 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:12:39,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 00:12:39,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 305 statements into 1 equivalence classes. [2025-03-04 00:12:39,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 305 of 305 statements. [2025-03-04 00:12:39,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:12:39,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:12:39,598 INFO L256 TraceCheckSpWp]: Trace formula consists of 741 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 00:12:39,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:12:39,915 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 1518 proven. 99 refuted. 0 times theorem prover too weak. 2343 trivial. 0 not checked. [2025-03-04 00:12:39,915 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:12:40,180 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 33 proven. 99 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2025-03-04 00:12:40,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1474898312] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:12:40,180 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:12:40,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-03-04 00:12:40,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854955424] [2025-03-04 00:12:40,181 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:12:40,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 00:12:40,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:12:40,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 00:12:40,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-04 00:12:40,182 INFO L87 Difference]: Start difference. First operand 317 states and 484 transitions. Second operand has 8 states, 8 states have (on average 15.625) internal successors, (125), 8 states have internal predecessors, (125), 3 states have call successors, (111), 2 states have call predecessors, (111), 4 states have return successors, (112), 3 states have call predecessors, (112), 3 states have call successors, (112) [2025-03-04 00:12:40,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:12:40,460 INFO L93 Difference]: Finished difference Result 544 states and 823 transitions. [2025-03-04 00:12:40,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 00:12:40,461 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 15.625) internal successors, (125), 8 states have internal predecessors, (125), 3 states have call successors, (111), 2 states have call predecessors, (111), 4 states have return successors, (112), 3 states have call predecessors, (112), 3 states have call successors, (112) Word has length 305 [2025-03-04 00:12:40,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:12:40,463 INFO L225 Difference]: With dead ends: 544 [2025-03-04 00:12:40,463 INFO L226 Difference]: Without dead ends: 333 [2025-03-04 00:12:40,465 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 616 GetRequests, 607 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2025-03-04 00:12:40,467 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 270 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:12:40,467 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 496 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 00:12:40,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2025-03-04 00:12:40,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 325. [2025-03-04 00:12:40,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 226 states have (on average 1.3628318584070795) internal successors, (308), 226 states have internal predecessors, (308), 90 states have call successors, (90), 8 states have call predecessors, (90), 8 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) [2025-03-04 00:12:40,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 488 transitions. [2025-03-04 00:12:40,498 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 488 transitions. Word has length 305 [2025-03-04 00:12:40,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:12:40,499 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 488 transitions. [2025-03-04 00:12:40,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.625) internal successors, (125), 8 states have internal predecessors, (125), 3 states have call successors, (111), 2 states have call predecessors, (111), 4 states have return successors, (112), 3 states have call predecessors, (112), 3 states have call successors, (112) [2025-03-04 00:12:40,499 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 488 transitions. [2025-03-04 00:12:40,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2025-03-04 00:12:40,501 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:12:40,501 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:12:40,508 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 00:12:40,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:12:40,702 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:12:40,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:12:40,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1729344420, now seen corresponding path program 1 times [2025-03-04 00:12:40,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:12:40,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978551187] [2025-03-04 00:12:40,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:12:40,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:12:40,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 305 statements into 1 equivalence classes. [2025-03-04 00:12:40,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 305 of 305 statements. [2025-03-04 00:12:40,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:12:40,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:12:41,192 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2025-03-04 00:12:41,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:12:41,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978551187] [2025-03-04 00:12:41,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978551187] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:12:41,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:12:41,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 00:12:41,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588413374] [2025-03-04 00:12:41,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:12:41,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 00:12:41,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:12:41,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 00:12:41,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:12:41,194 INFO L87 Difference]: Start difference. First operand 325 states and 488 transitions. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-03-04 00:12:41,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:12:41,531 INFO L93 Difference]: Finished difference Result 614 states and 924 transitions. [2025-03-04 00:12:41,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 00:12:41,531 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) Word has length 305 [2025-03-04 00:12:41,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:12:41,533 INFO L225 Difference]: With dead ends: 614 [2025-03-04 00:12:41,533 INFO L226 Difference]: Without dead ends: 400 [2025-03-04 00:12:41,534 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-04 00:12:41,534 INFO L435 NwaCegarLoop]: 244 mSDtfsCounter, 303 mSDsluCounter, 650 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 894 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:12:41,534 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 894 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 00:12:41,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2025-03-04 00:12:41,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 311. [2025-03-04 00:12:41,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 211 states have (on average 1.3317535545023698) internal successors, (281), 211 states have internal predecessors, (281), 90 states have call successors, (90), 9 states have call predecessors, (90), 9 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) [2025-03-04 00:12:41,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 461 transitions. [2025-03-04 00:12:41,556 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 461 transitions. Word has length 305 [2025-03-04 00:12:41,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:12:41,556 INFO L471 AbstractCegarLoop]: Abstraction has 311 states and 461 transitions. [2025-03-04 00:12:41,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-03-04 00:12:41,556 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 461 transitions. [2025-03-04 00:12:41,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2025-03-04 00:12:41,559 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:12:41,560 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:12:41,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 00:12:41,560 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:12:41,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:12:41,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1422733668, now seen corresponding path program 1 times [2025-03-04 00:12:41,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:12:41,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263133150] [2025-03-04 00:12:41,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:12:41,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:12:41,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 305 statements into 1 equivalence classes. [2025-03-04 00:12:41,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 305 of 305 statements. [2025-03-04 00:12:41,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:12:41,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:12:42,117 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 6 proven. 126 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2025-03-04 00:12:42,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:12:42,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263133150] [2025-03-04 00:12:42,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263133150] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:12:42,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [757105062] [2025-03-04 00:12:42,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:12:42,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:12:42,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:12:42,119 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:12:42,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 00:12:42,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 305 statements into 1 equivalence classes. [2025-03-04 00:12:42,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 305 of 305 statements. [2025-03-04 00:12:42,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:12:42,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:12:42,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 741 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 00:12:42,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:12:42,439 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 1892 proven. 48 refuted. 0 times theorem prover too weak. 2020 trivial. 0 not checked. [2025-03-04 00:12:42,439 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:12:42,639 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 84 proven. 48 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2025-03-04 00:12:42,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [757105062] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:12:42,642 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:12:42,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2025-03-04 00:12:42,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239124948] [2025-03-04 00:12:42,642 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:12:42,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 00:12:42,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:12:42,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 00:12:42,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-04 00:12:42,643 INFO L87 Difference]: Start difference. First operand 311 states and 461 transitions. Second operand has 9 states, 9 states have (on average 15.88888888888889) internal successors, (143), 9 states have internal predecessors, (143), 4 states have call successors, (106), 2 states have call predecessors, (106), 4 states have return successors, (107), 4 states have call predecessors, (107), 4 states have call successors, (107) [2025-03-04 00:12:43,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:12:43,116 INFO L93 Difference]: Finished difference Result 544 states and 798 transitions. [2025-03-04 00:12:43,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 00:12:43,117 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 15.88888888888889) internal successors, (143), 9 states have internal predecessors, (143), 4 states have call successors, (106), 2 states have call predecessors, (106), 4 states have return successors, (107), 4 states have call predecessors, (107), 4 states have call successors, (107) Word has length 305 [2025-03-04 00:12:43,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:12:43,120 INFO L225 Difference]: With dead ends: 544 [2025-03-04 00:12:43,120 INFO L226 Difference]: Without dead ends: 334 [2025-03-04 00:12:43,121 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 626 GetRequests, 608 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2025-03-04 00:12:43,121 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 715 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 302 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 715 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 302 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:12:43,122 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [715 Valid, 444 Invalid, 618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [302 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 00:12:43,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2025-03-04 00:12:43,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 326. [2025-03-04 00:12:43,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 222 states have (on average 1.2882882882882882) internal successors, (286), 222 states have internal predecessors, (286), 90 states have call successors, (90), 13 states have call predecessors, (90), 13 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) [2025-03-04 00:12:43,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 466 transitions. [2025-03-04 00:12:43,155 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 466 transitions. Word has length 305 [2025-03-04 00:12:43,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:12:43,156 INFO L471 AbstractCegarLoop]: Abstraction has 326 states and 466 transitions. [2025-03-04 00:12:43,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.88888888888889) internal successors, (143), 9 states have internal predecessors, (143), 4 states have call successors, (106), 2 states have call predecessors, (106), 4 states have return successors, (107), 4 states have call predecessors, (107), 4 states have call successors, (107) [2025-03-04 00:12:43,156 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 466 transitions. [2025-03-04 00:12:43,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2025-03-04 00:12:43,158 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:12:43,158 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:12:43,166 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 00:12:43,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:12:43,359 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:12:43,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:12:43,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1309871864, now seen corresponding path program 1 times [2025-03-04 00:12:43,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:12:43,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026572186] [2025-03-04 00:12:43,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:12:43,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:12:43,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes. [2025-03-04 00:12:43,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements. [2025-03-04 00:12:43,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:12:43,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:12:43,590 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2025-03-04 00:12:43,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:12:43,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026572186] [2025-03-04 00:12:43,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026572186] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:12:43,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:12:43,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 00:12:43,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499263018] [2025-03-04 00:12:43,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:12:43,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 00:12:43,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:12:43,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 00:12:43,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:12:43,592 INFO L87 Difference]: Start difference. First operand 326 states and 466 transitions. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-03-04 00:12:43,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:12:43,873 INFO L93 Difference]: Finished difference Result 816 states and 1185 transitions. [2025-03-04 00:12:43,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 00:12:43,873 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) Word has length 307 [2025-03-04 00:12:43,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:12:43,877 INFO L225 Difference]: With dead ends: 816 [2025-03-04 00:12:43,877 INFO L226 Difference]: Without dead ends: 599 [2025-03-04 00:12:43,878 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-04 00:12:43,879 INFO L435 NwaCegarLoop]: 305 mSDtfsCounter, 284 mSDsluCounter, 653 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 958 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:12:43,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 958 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 00:12:43,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2025-03-04 00:12:43,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 527. [2025-03-04 00:12:43,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 372 states have (on average 1.3172043010752688) internal successors, (490), 372 states have internal predecessors, (490), 135 states have call successors, (135), 19 states have call predecessors, (135), 19 states have return successors, (135), 135 states have call predecessors, (135), 135 states have call successors, (135) [2025-03-04 00:12:43,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 760 transitions. [2025-03-04 00:12:43,931 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 760 transitions. Word has length 307 [2025-03-04 00:12:43,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:12:43,932 INFO L471 AbstractCegarLoop]: Abstraction has 527 states and 760 transitions. [2025-03-04 00:12:43,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-03-04 00:12:43,932 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 760 transitions. [2025-03-04 00:12:43,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2025-03-04 00:12:43,933 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:12:43,933 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:12:43,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 00:12:43,934 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:12:43,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:12:43,934 INFO L85 PathProgramCache]: Analyzing trace with hash 661067593, now seen corresponding path program 1 times [2025-03-04 00:12:43,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:12:43,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247619411] [2025-03-04 00:12:43,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:12:43,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:12:43,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes. [2025-03-04 00:12:44,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements. [2025-03-04 00:12:44,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:12:44,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:12:44,486 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 75 proven. 57 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2025-03-04 00:12:44,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:12:44,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247619411] [2025-03-04 00:12:44,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247619411] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:12:44,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [866045698] [2025-03-04 00:12:44,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:12:44,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:12:44,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:12:44,490 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:12:44,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 00:12:44,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes. [2025-03-04 00:12:44,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements. [2025-03-04 00:12:44,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:12:44,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:12:44,682 INFO L256 TraceCheckSpWp]: Trace formula consists of 744 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 00:12:44,687 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:12:45,171 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 2085 proven. 105 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2025-03-04 00:12:45,172 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:12:45,545 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 75 proven. 57 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2025-03-04 00:12:45,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [866045698] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:12:45,545 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:12:45,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 7] total 15 [2025-03-04 00:12:45,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993785323] [2025-03-04 00:12:45,546 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:12:45,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 00:12:45,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:12:45,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 00:12:45,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2025-03-04 00:12:45,547 INFO L87 Difference]: Start difference. First operand 527 states and 760 transitions. Second operand has 15 states, 15 states have (on average 10.666666666666666) internal successors, (160), 15 states have internal predecessors, (160), 3 states have call successors, (64), 3 states have call predecessors, (64), 6 states have return successors, (65), 3 states have call predecessors, (65), 3 states have call successors, (65) [2025-03-04 00:12:48,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:12:48,320 INFO L93 Difference]: Finished difference Result 2997 states and 4155 transitions. [2025-03-04 00:12:48,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2025-03-04 00:12:48,321 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 10.666666666666666) internal successors, (160), 15 states have internal predecessors, (160), 3 states have call successors, (64), 3 states have call predecessors, (64), 6 states have return successors, (65), 3 states have call predecessors, (65), 3 states have call successors, (65) Word has length 307 [2025-03-04 00:12:48,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:12:48,333 INFO L225 Difference]: With dead ends: 2997 [2025-03-04 00:12:48,334 INFO L226 Difference]: Without dead ends: 2593 [2025-03-04 00:12:48,336 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 700 GetRequests, 619 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2389 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1475, Invalid=5167, Unknown=0, NotChecked=0, Total=6642 [2025-03-04 00:12:48,338 INFO L435 NwaCegarLoop]: 660 mSDtfsCounter, 911 mSDsluCounter, 2222 mSDsCounter, 0 mSdLazyCounter, 2801 mSolverCounterSat, 445 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 915 SdHoareTripleChecker+Valid, 2882 SdHoareTripleChecker+Invalid, 3246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 445 IncrementalHoareTripleChecker+Valid, 2801 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-04 00:12:48,338 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [915 Valid, 2882 Invalid, 3246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [445 Valid, 2801 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-04 00:12:48,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2593 states. [2025-03-04 00:12:48,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2593 to 583. [2025-03-04 00:12:48,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 583 states, 419 states have (on average 1.2625298329355608) internal successors, (529), 419 states have internal predecessors, (529), 135 states have call successors, (135), 28 states have call predecessors, (135), 28 states have return successors, (135), 135 states have call predecessors, (135), 135 states have call successors, (135) [2025-03-04 00:12:48,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 799 transitions. [2025-03-04 00:12:48,411 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 799 transitions. Word has length 307 [2025-03-04 00:12:48,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:12:48,411 INFO L471 AbstractCegarLoop]: Abstraction has 583 states and 799 transitions. [2025-03-04 00:12:48,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 10.666666666666666) internal successors, (160), 15 states have internal predecessors, (160), 3 states have call successors, (64), 3 states have call predecessors, (64), 6 states have return successors, (65), 3 states have call predecessors, (65), 3 states have call successors, (65) [2025-03-04 00:12:48,412 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 799 transitions. [2025-03-04 00:12:48,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2025-03-04 00:12:48,413 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:12:48,413 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:12:48,421 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 00:12:48,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-04 00:12:48,614 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:12:48,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:12:48,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1633069544, now seen corresponding path program 1 times [2025-03-04 00:12:48,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:12:48,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186957889] [2025-03-04 00:12:48,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:12:48,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:12:48,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 308 statements into 1 equivalence classes. [2025-03-04 00:12:48,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 308 of 308 statements. [2025-03-04 00:12:48,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:12:48,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:12:49,997 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2025-03-04 00:12:49,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:12:49,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186957889] [2025-03-04 00:12:49,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186957889] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:12:49,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:12:49,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 00:12:49,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945095723] [2025-03-04 00:12:49,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:12:49,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 00:12:49,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:12:50,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 00:12:50,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 00:12:50,000 INFO L87 Difference]: Start difference. First operand 583 states and 799 transitions. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-03-04 00:12:50,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:12:50,760 INFO L93 Difference]: Finished difference Result 1609 states and 2239 transitions. [2025-03-04 00:12:50,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 00:12:50,760 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) Word has length 308 [2025-03-04 00:12:50,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:12:50,764 INFO L225 Difference]: With dead ends: 1609 [2025-03-04 00:12:50,764 INFO L226 Difference]: Without dead ends: 1161 [2025-03-04 00:12:50,765 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2025-03-04 00:12:50,765 INFO L435 NwaCegarLoop]: 370 mSDtfsCounter, 678 mSDsluCounter, 1226 mSDsCounter, 0 mSdLazyCounter, 718 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 678 SdHoareTripleChecker+Valid, 1596 SdHoareTripleChecker+Invalid, 855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 00:12:50,766 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [678 Valid, 1596 Invalid, 855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 718 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 00:12:50,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1161 states. [2025-03-04 00:12:50,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1161 to 594. [2025-03-04 00:12:50,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 594 states, 430 states have (on average 1.2651162790697674) internal successors, (544), 430 states have internal predecessors, (544), 135 states have call successors, (135), 28 states have call predecessors, (135), 28 states have return successors, (135), 135 states have call predecessors, (135), 135 states have call successors, (135) [2025-03-04 00:12:50,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 814 transitions. [2025-03-04 00:12:50,814 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 814 transitions. Word has length 308 [2025-03-04 00:12:50,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:12:50,815 INFO L471 AbstractCegarLoop]: Abstraction has 594 states and 814 transitions. [2025-03-04 00:12:50,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-03-04 00:12:50,815 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 814 transitions. [2025-03-04 00:12:50,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2025-03-04 00:12:50,816 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:12:50,816 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:12:50,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 00:12:50,816 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:12:50,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:12:50,817 INFO L85 PathProgramCache]: Analyzing trace with hash 2081766183, now seen corresponding path program 1 times [2025-03-04 00:12:50,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:12:50,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513673875] [2025-03-04 00:12:50,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:12:50,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:12:50,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 308 statements into 1 equivalence classes. [2025-03-04 00:12:50,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 308 of 308 statements. [2025-03-04 00:12:50,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:12:50,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:12:51,032 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2025-03-04 00:12:51,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:12:51,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513673875] [2025-03-04 00:12:51,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513673875] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:12:51,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:12:51,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:12:51,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871885626] [2025-03-04 00:12:51,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:12:51,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:12:51,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:12:51,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:12:51,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:12:51,034 INFO L87 Difference]: Start difference. First operand 594 states and 814 transitions. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-03-04 00:12:51,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:12:51,259 INFO L93 Difference]: Finished difference Result 1554 states and 2143 transitions. [2025-03-04 00:12:51,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:12:51,259 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) Word has length 308 [2025-03-04 00:12:51,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:12:51,263 INFO L225 Difference]: With dead ends: 1554 [2025-03-04 00:12:51,264 INFO L226 Difference]: Without dead ends: 1100 [2025-03-04 00:12:51,264 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:12:51,265 INFO L435 NwaCegarLoop]: 277 mSDtfsCounter, 263 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 745 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:12:51,265 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 745 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:12:51,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1100 states. [2025-03-04 00:12:51,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1100 to 1008. [2025-03-04 00:12:51,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1008 states, 736 states have (on average 1.266304347826087) internal successors, (932), 736 states have internal predecessors, (932), 225 states have call successors, (225), 46 states have call predecessors, (225), 46 states have return successors, (225), 225 states have call predecessors, (225), 225 states have call successors, (225) [2025-03-04 00:12:51,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1008 states to 1008 states and 1382 transitions. [2025-03-04 00:12:51,340 INFO L78 Accepts]: Start accepts. Automaton has 1008 states and 1382 transitions. Word has length 308 [2025-03-04 00:12:51,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:12:51,341 INFO L471 AbstractCegarLoop]: Abstraction has 1008 states and 1382 transitions. [2025-03-04 00:12:51,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-03-04 00:12:51,341 INFO L276 IsEmpty]: Start isEmpty. Operand 1008 states and 1382 transitions. [2025-03-04 00:12:51,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2025-03-04 00:12:51,342 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:12:51,342 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:12:51,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 00:12:51,342 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:12:51,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:12:51,343 INFO L85 PathProgramCache]: Analyzing trace with hash -737513810, now seen corresponding path program 1 times [2025-03-04 00:12:51,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:12:51,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998518158] [2025-03-04 00:12:51,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:12:51,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:12:51,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 309 statements into 1 equivalence classes. [2025-03-04 00:12:51,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 309 of 309 statements. [2025-03-04 00:12:51,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:12:51,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:12:51,874 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 81 proven. 51 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2025-03-04 00:12:51,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:12:51,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998518158] [2025-03-04 00:12:51,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998518158] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:12:51,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2093539126] [2025-03-04 00:12:51,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:12:51,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:12:51,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:12:51,877 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:12:51,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 00:12:51,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 309 statements into 1 equivalence classes. [2025-03-04 00:12:52,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 309 of 309 statements. [2025-03-04 00:12:52,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:12:52,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:12:52,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 752 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 00:12:52,049 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:12:52,447 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 1934 proven. 51 refuted. 0 times theorem prover too weak. 1975 trivial. 0 not checked. [2025-03-04 00:12:52,448 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:12:52,717 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 81 proven. 51 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2025-03-04 00:12:52,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2093539126] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:12:52,717 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:12:52,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 7] total 16 [2025-03-04 00:12:52,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458524648] [2025-03-04 00:12:52,717 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:12:52,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 00:12:52,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:12:52,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 00:12:52,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2025-03-04 00:12:52,719 INFO L87 Difference]: Start difference. First operand 1008 states and 1382 transitions. Second operand has 16 states, 16 states have (on average 10.375) internal successors, (166), 16 states have internal predecessors, (166), 5 states have call successors, (107), 3 states have call predecessors, (107), 6 states have return successors, (108), 5 states have call predecessors, (108), 5 states have call successors, (108) [2025-03-04 00:12:53,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:12:53,279 INFO L93 Difference]: Finished difference Result 2089 states and 2854 transitions. [2025-03-04 00:12:53,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-04 00:12:53,279 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 10.375) internal successors, (166), 16 states have internal predecessors, (166), 5 states have call successors, (107), 3 states have call predecessors, (107), 6 states have return successors, (108), 5 states have call predecessors, (108), 5 states have call successors, (108) Word has length 309 [2025-03-04 00:12:53,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:12:53,284 INFO L225 Difference]: With dead ends: 2089 [2025-03-04 00:12:53,284 INFO L226 Difference]: Without dead ends: 1209 [2025-03-04 00:12:53,285 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 636 GetRequests, 608 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=198, Invalid=614, Unknown=0, NotChecked=0, Total=812 [2025-03-04 00:12:53,286 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 513 mSDsluCounter, 1185 mSDsCounter, 0 mSdLazyCounter, 807 mSolverCounterSat, 212 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 539 SdHoareTripleChecker+Valid, 1365 SdHoareTripleChecker+Invalid, 1019 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 212 IncrementalHoareTripleChecker+Valid, 807 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 00:12:53,286 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [539 Valid, 1365 Invalid, 1019 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [212 Valid, 807 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 00:12:53,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1209 states. [2025-03-04 00:12:53,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1209 to 1004. [2025-03-04 00:12:53,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1004 states, 732 states have (on average 1.25) internal successors, (915), 732 states have internal predecessors, (915), 225 states have call successors, (225), 46 states have call predecessors, (225), 46 states have return successors, (225), 225 states have call predecessors, (225), 225 states have call successors, (225) [2025-03-04 00:12:53,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1004 states to 1004 states and 1365 transitions. [2025-03-04 00:12:53,369 INFO L78 Accepts]: Start accepts. Automaton has 1004 states and 1365 transitions. Word has length 309 [2025-03-04 00:12:53,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:12:53,370 INFO L471 AbstractCegarLoop]: Abstraction has 1004 states and 1365 transitions. [2025-03-04 00:12:53,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 10.375) internal successors, (166), 16 states have internal predecessors, (166), 5 states have call successors, (107), 3 states have call predecessors, (107), 6 states have return successors, (108), 5 states have call predecessors, (108), 5 states have call successors, (108) [2025-03-04 00:12:53,370 INFO L276 IsEmpty]: Start isEmpty. Operand 1004 states and 1365 transitions. [2025-03-04 00:12:53,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2025-03-04 00:12:53,371 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:12:53,371 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:12:53,379 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 00:12:53,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:12:53,575 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:12:53,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:12:53,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1618987036, now seen corresponding path program 1 times [2025-03-04 00:12:53,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:12:53,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880069590] [2025-03-04 00:12:53,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:12:53,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:12:53,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 310 statements into 1 equivalence classes. [2025-03-04 00:12:53,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 310 of 310 statements. [2025-03-04 00:12:53,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:12:53,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:12:57,359 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 9 proven. 123 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2025-03-04 00:12:57,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:12:57,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880069590] [2025-03-04 00:12:57,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880069590] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:12:57,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [555311550] [2025-03-04 00:12:57,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:12:57,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:12:57,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:12:57,363 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:12:57,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 00:12:57,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 310 statements into 1 equivalence classes. [2025-03-04 00:12:57,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 310 of 310 statements. [2025-03-04 00:12:57,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:12:57,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:12:57,567 INFO L256 TraceCheckSpWp]: Trace formula consists of 755 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-04 00:12:57,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:12:58,676 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 1359 proven. 204 refuted. 0 times theorem prover too weak. 2397 trivial. 0 not checked. [2025-03-04 00:12:58,676 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:12:59,308 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 27 proven. 105 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2025-03-04 00:12:59,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [555311550] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:12:59,309 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:12:59,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 9] total 30 [2025-03-04 00:12:59,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257948626] [2025-03-04 00:12:59,309 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:12:59,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-04 00:12:59,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:12:59,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-04 00:12:59,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=755, Unknown=0, NotChecked=0, Total=870 [2025-03-04 00:12:59,311 INFO L87 Difference]: Start difference. First operand 1004 states and 1365 transitions. Second operand has 30 states, 30 states have (on average 7.6) internal successors, (228), 29 states have internal predecessors, (228), 8 states have call successors, (125), 3 states have call predecessors, (125), 5 states have return successors, (126), 7 states have call predecessors, (126), 8 states have call successors, (126) [2025-03-04 00:13:08,511 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-04 00:13:15,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:13:15,201 INFO L93 Difference]: Finished difference Result 5480 states and 7297 transitions. [2025-03-04 00:13:15,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2025-03-04 00:13:15,202 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 7.6) internal successors, (228), 29 states have internal predecessors, (228), 8 states have call successors, (125), 3 states have call predecessors, (125), 5 states have return successors, (126), 7 states have call predecessors, (126), 8 states have call successors, (126) Word has length 310 [2025-03-04 00:13:15,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:13:15,214 INFO L225 Difference]: With dead ends: 5480 [2025-03-04 00:13:15,214 INFO L226 Difference]: Without dead ends: 4616 [2025-03-04 00:13:15,218 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 729 GetRequests, 622 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3477 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=2427, Invalid=9345, Unknown=0, NotChecked=0, Total=11772 [2025-03-04 00:13:15,218 INFO L435 NwaCegarLoop]: 254 mSDtfsCounter, 4061 mSDsluCounter, 2506 mSDsCounter, 0 mSdLazyCounter, 4514 mSolverCounterSat, 611 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4061 SdHoareTripleChecker+Valid, 2760 SdHoareTripleChecker+Invalid, 5126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 611 IncrementalHoareTripleChecker+Valid, 4514 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2025-03-04 00:13:15,219 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4061 Valid, 2760 Invalid, 5126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [611 Valid, 4514 Invalid, 1 Unknown, 0 Unchecked, 8.8s Time] [2025-03-04 00:13:15,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4616 states. [2025-03-04 00:13:15,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4616 to 3318. [2025-03-04 00:13:15,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3318 states, 2719 states have (on average 1.2997425524089739) internal successors, (3534), 2731 states have internal predecessors, (3534), 457 states have call successors, (457), 141 states have call predecessors, (457), 141 states have return successors, (457), 445 states have call predecessors, (457), 457 states have call successors, (457) [2025-03-04 00:13:15,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3318 states to 3318 states and 4448 transitions. [2025-03-04 00:13:15,521 INFO L78 Accepts]: Start accepts. Automaton has 3318 states and 4448 transitions. Word has length 310 [2025-03-04 00:13:15,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:13:15,521 INFO L471 AbstractCegarLoop]: Abstraction has 3318 states and 4448 transitions. [2025-03-04 00:13:15,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 7.6) internal successors, (228), 29 states have internal predecessors, (228), 8 states have call successors, (125), 3 states have call predecessors, (125), 5 states have return successors, (126), 7 states have call predecessors, (126), 8 states have call successors, (126) [2025-03-04 00:13:15,522 INFO L276 IsEmpty]: Start isEmpty. Operand 3318 states and 4448 transitions. [2025-03-04 00:13:15,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2025-03-04 00:13:15,524 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:13:15,524 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:13:15,533 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 00:13:15,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:13:15,725 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:13:15,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:13:15,725 INFO L85 PathProgramCache]: Analyzing trace with hash -265677339, now seen corresponding path program 1 times [2025-03-04 00:13:15,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:13:15,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766866060] [2025-03-04 00:13:15,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:13:15,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:13:15,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 310 statements into 1 equivalence classes. [2025-03-04 00:13:16,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 310 of 310 statements. [2025-03-04 00:13:16,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:13:16,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:13:38,105 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 150 proven. 342 refuted. 0 times theorem prover too weak. 3468 trivial. 0 not checked. [2025-03-04 00:13:38,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:13:38,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766866060] [2025-03-04 00:13:38,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766866060] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:13:38,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [503342587] [2025-03-04 00:13:38,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:13:38,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:13:38,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:13:38,107 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:13:38,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 00:13:38,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 310 statements into 1 equivalence classes. [2025-03-04 00:13:38,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 310 of 310 statements. [2025-03-04 00:13:38,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:13:38,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:13:38,319 INFO L256 TraceCheckSpWp]: Trace formula consists of 752 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 00:13:38,323 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:13:40,459 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 2093 proven. 318 refuted. 0 times theorem prover too weak. 1549 trivial. 0 not checked. [2025-03-04 00:13:40,459 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:13:42,041 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 60 proven. 327 refuted. 0 times theorem prover too weak. 3573 trivial. 0 not checked. [2025-03-04 00:13:42,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [503342587] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:13:42,042 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:13:42,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 13, 13] total 39 [2025-03-04 00:13:42,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812551481] [2025-03-04 00:13:42,042 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:13:42,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-03-04 00:13:42,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:13:42,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-03-04 00:13:42,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=1302, Unknown=0, NotChecked=0, Total=1482 [2025-03-04 00:13:42,044 INFO L87 Difference]: Start difference. First operand 3318 states and 4448 transitions. Second operand has 39 states, 37 states have (on average 6.45945945945946) internal successors, (239), 38 states have internal predecessors, (239), 15 states have call successors, (134), 5 states have call predecessors, (134), 11 states have return successors, (135), 14 states have call predecessors, (135), 15 states have call successors, (135)