./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-78.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-78.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 ce36ae11817d8408b28b87366201df9141e6e75d787dae6b6223431c24a32438 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:15:15,087 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:15:15,140 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 00:15:15,146 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:15:15,146 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:15:15,161 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:15:15,163 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:15:15,163 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:15:15,163 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:15:15,164 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:15:15,164 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:15:15,164 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:15:15,165 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:15:15,165 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:15:15,165 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:15:15,165 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:15:15,166 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:15:15,166 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:15:15,166 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 00:15:15,166 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:15:15,166 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:15:15,166 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:15:15,166 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:15:15,166 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:15:15,166 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:15:15,166 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:15:15,167 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:15:15,167 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:15:15,167 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:15:15,167 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:15:15,167 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:15:15,167 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:15:15,167 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:15:15,168 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:15:15,168 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:15:15,168 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:15:15,168 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:15:15,168 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 00:15:15,168 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 00:15:15,168 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:15:15,168 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:15:15,168 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:15:15,168 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:15:15,168 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 -> ce36ae11817d8408b28b87366201df9141e6e75d787dae6b6223431c24a32438 [2025-03-04 00:15:15,426 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:15:15,433 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:15:15,435 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:15:15,436 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:15:15,437 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:15:15,438 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-78.i [2025-03-04 00:15:16,592 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02b0cf5ce/fc8775acd30b4675b2e19fc3294361ae/FLAG774a48b62 [2025-03-04 00:15:16,852 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:15:16,853 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-78.i [2025-03-04 00:15:16,859 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02b0cf5ce/fc8775acd30b4675b2e19fc3294361ae/FLAG774a48b62 [2025-03-04 00:15:17,155 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02b0cf5ce/fc8775acd30b4675b2e19fc3294361ae [2025-03-04 00:15:17,157 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:15:17,158 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:15:17,159 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:15:17,159 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:15:17,162 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:15:17,162 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:15:17" (1/1) ... [2025-03-04 00:15:17,163 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cadd78b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:15:17, skipping insertion in model container [2025-03-04 00:15:17,163 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:15:17" (1/1) ... [2025-03-04 00:15:17,182 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:15:17,281 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-78.i[916,929] [2025-03-04 00:15:17,426 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:15:17,440 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:15:17,447 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-78.i[916,929] [2025-03-04 00:15:17,519 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:15:17,539 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:15:17,540 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:15:17 WrapperNode [2025-03-04 00:15:17,540 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:15:17,541 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:15:17,541 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:15:17,542 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:15:17,546 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:15:17" (1/1) ... [2025-03-04 00:15:17,566 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:15:17" (1/1) ... [2025-03-04 00:15:17,637 INFO L138 Inliner]: procedures = 26, calls = 69, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 476 [2025-03-04 00:15:17,637 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:15:17,638 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:15:17,638 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:15:17,638 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:15:17,644 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:15:17" (1/1) ... [2025-03-04 00:15:17,644 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:15:17" (1/1) ... [2025-03-04 00:15:17,652 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:15:17" (1/1) ... [2025-03-04 00:15:17,689 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:15:17,689 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:15:17" (1/1) ... [2025-03-04 00:15:17,689 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:15:17" (1/1) ... [2025-03-04 00:15:17,709 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:15:17" (1/1) ... [2025-03-04 00:15:17,714 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:15:17" (1/1) ... [2025-03-04 00:15:17,719 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:15:17" (1/1) ... [2025-03-04 00:15:17,725 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:15:17" (1/1) ... [2025-03-04 00:15:17,735 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:15:17,736 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:15:17,736 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:15:17,736 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:15:17,738 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:15:17" (1/1) ... [2025-03-04 00:15:17,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:15:17,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:15:17,764 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:15:17,767 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:15:17,782 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:15:17,783 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:15:17,783 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:15:17,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 00:15:17,783 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:15:17,783 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:15:17,868 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:15:17,869 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:15:18,500 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L384: havoc property_#t~bitwise40#1;havoc property_#t~short41#1;havoc property_#t~bitwise42#1;havoc property_#t~short43#1;havoc property_#t~ite45#1;havoc property_#t~bitwise44#1;havoc property_#t~short46#1;havoc property_#t~bitwise47#1;havoc property_#t~short48#1; [2025-03-04 00:15:18,566 INFO L? ?]: Removed 46 outVars from TransFormulas that were not future-live. [2025-03-04 00:15:18,567 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:15:18,593 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:15:18,596 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:15:18,596 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:15:18 BoogieIcfgContainer [2025-03-04 00:15:18,596 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:15:18,598 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:15:18,598 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:15:18,601 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:15:18,602 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:15:17" (1/3) ... [2025-03-04 00:15:18,603 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@313e4b45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:15:18, skipping insertion in model container [2025-03-04 00:15:18,603 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:15:17" (2/3) ... [2025-03-04 00:15:18,603 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@313e4b45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:15:18, skipping insertion in model container [2025-03-04 00:15:18,604 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:15:18" (3/3) ... [2025-03-04 00:15:18,605 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-78.i [2025-03-04 00:15:18,617 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:15:18,620 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount250_file-78.i that has 2 procedures, 201 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:15:18,669 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:15:18,680 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;@64c00a02, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:15:18,681 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:15:18,686 INFO L276 IsEmpty]: Start isEmpty. Operand has 201 states, 142 states have (on average 1.5140845070422535) internal successors, (215), 143 states have internal predecessors, (215), 56 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-04 00:15:18,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2025-03-04 00:15:18,703 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:15:18,704 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:18,705 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:15:18,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:15:18,709 INFO L85 PathProgramCache]: Analyzing trace with hash 2118246385, now seen corresponding path program 1 times [2025-03-04 00:15:18,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:15:18,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944037101] [2025-03-04 00:15:18,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:15:18,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:15:18,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 365 statements into 1 equivalence classes. [2025-03-04 00:15:18,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 365 of 365 statements. [2025-03-04 00:15:18,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:15:18,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:15:19,167 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 6050 trivial. 0 not checked. [2025-03-04 00:15:19,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:15:19,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944037101] [2025-03-04 00:15:19,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944037101] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:15:19,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1864175487] [2025-03-04 00:15:19,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:15:19,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:15:19,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:15:19,172 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:15:19,174 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:15:19,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 365 statements into 1 equivalence classes. [2025-03-04 00:15:19,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 365 of 365 statements. [2025-03-04 00:15:19,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:15:19,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:15:19,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 835 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:15:19,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:15:19,450 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 6050 trivial. 0 not checked. [2025-03-04 00:15:19,450 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:15:19,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1864175487] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:15:19,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:15:19,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 00:15:19,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653406866] [2025-03-04 00:15:19,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:15:19,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:15:19,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:15:19,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:15:19,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:15:19,471 INFO L87 Difference]: Start difference. First operand has 201 states, 142 states have (on average 1.5140845070422535) internal successors, (215), 143 states have internal predecessors, (215), 56 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) Second operand has 2 states, 2 states have (on average 45.0) internal successors, (90), 2 states have internal predecessors, (90), 2 states have call successors, (56), 2 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 2 states have call successors, (56) [2025-03-04 00:15:19,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:15:19,522 INFO L93 Difference]: Finished difference Result 396 states and 705 transitions. [2025-03-04 00:15:19,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:15:19,527 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 45.0) internal successors, (90), 2 states have internal predecessors, (90), 2 states have call successors, (56), 2 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 2 states have call successors, (56) Word has length 365 [2025-03-04 00:15:19,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:15:19,535 INFO L225 Difference]: With dead ends: 396 [2025-03-04 00:15:19,536 INFO L226 Difference]: Without dead ends: 198 [2025-03-04 00:15:19,540 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 366 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:15:19,542 INFO L435 NwaCegarLoop]: 314 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:15:19,542 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 314 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:15:19,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2025-03-04 00:15:19,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2025-03-04 00:15:19,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 140 states have (on average 1.5) internal successors, (210), 140 states have internal predecessors, (210), 56 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-04 00:15:19,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 322 transitions. [2025-03-04 00:15:19,586 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 322 transitions. Word has length 365 [2025-03-04 00:15:19,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:15:19,586 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 322 transitions. [2025-03-04 00:15:19,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 45.0) internal successors, (90), 2 states have internal predecessors, (90), 2 states have call successors, (56), 2 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 2 states have call successors, (56) [2025-03-04 00:15:19,587 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 322 transitions. [2025-03-04 00:15:19,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2025-03-04 00:15:19,600 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:15:19,600 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:19,612 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 00:15:19,807 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:15:19,807 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:15:19,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:15:19,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1703932465, now seen corresponding path program 1 times [2025-03-04 00:15:19,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:15:19,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523327721] [2025-03-04 00:15:19,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:15:19,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:15:19,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 365 statements into 1 equivalence classes. [2025-03-04 00:15:19,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 365 of 365 statements. [2025-03-04 00:15:19,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:15:19,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:15:20,152 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2025-03-04 00:15:20,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:15:20,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523327721] [2025-03-04 00:15:20,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523327721] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:15:20,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:15:20,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:15:20,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083315225] [2025-03-04 00:15:20,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:15:20,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:15:20,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:15:20,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:15:20,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:15:20,157 INFO L87 Difference]: Start difference. First operand 198 states and 322 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-03-04 00:15:20,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:15:20,304 INFO L93 Difference]: Finished difference Result 585 states and 954 transitions. [2025-03-04 00:15:20,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:15:20,306 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) Word has length 365 [2025-03-04 00:15:20,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:15:20,310 INFO L225 Difference]: With dead ends: 585 [2025-03-04 00:15:20,310 INFO L226 Difference]: Without dead ends: 390 [2025-03-04 00:15:20,315 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:15:20,316 INFO L435 NwaCegarLoop]: 348 mSDtfsCounter, 297 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:15:20,316 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 624 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:15:20,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2025-03-04 00:15:20,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 386. [2025-03-04 00:15:20,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 271 states have (on average 1.4612546125461254) internal successors, (396), 271 states have internal predecessors, (396), 112 states have call successors, (112), 2 states have call predecessors, (112), 2 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) [2025-03-04 00:15:20,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 620 transitions. [2025-03-04 00:15:20,389 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 620 transitions. Word has length 365 [2025-03-04 00:15:20,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:15:20,394 INFO L471 AbstractCegarLoop]: Abstraction has 386 states and 620 transitions. [2025-03-04 00:15:20,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-03-04 00:15:20,394 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 620 transitions. [2025-03-04 00:15:20,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2025-03-04 00:15:20,397 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:15:20,399 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:20,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 00:15:20,399 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:15:20,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:15:20,400 INFO L85 PathProgramCache]: Analyzing trace with hash -554022116, now seen corresponding path program 1 times [2025-03-04 00:15:20,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:15:20,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90955341] [2025-03-04 00:15:20,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:15:20,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:15:20,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 366 statements into 1 equivalence classes. [2025-03-04 00:15:20,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 366 of 366 statements. [2025-03-04 00:15:20,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:15:20,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:15:20,711 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2025-03-04 00:15:20,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:15:20,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90955341] [2025-03-04 00:15:20,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90955341] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:15:20,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:15:20,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:15:20,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793486154] [2025-03-04 00:15:20,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:15:20,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:15:20,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:15:20,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:15:20,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:15:20,718 INFO L87 Difference]: Start difference. First operand 386 states and 620 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-03-04 00:15:20,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:15:20,888 INFO L93 Difference]: Finished difference Result 779 states and 1253 transitions. [2025-03-04 00:15:20,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:15:20,889 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) Word has length 366 [2025-03-04 00:15:20,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:15:20,893 INFO L225 Difference]: With dead ends: 779 [2025-03-04 00:15:20,895 INFO L226 Difference]: Without dead ends: 396 [2025-03-04 00:15:20,896 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:15:20,898 INFO L435 NwaCegarLoop]: 472 mSDtfsCounter, 281 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 754 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:15:20,899 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 754 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:15:20,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2025-03-04 00:15:20,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 392. [2025-03-04 00:15:20,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 277 states have (on average 1.44043321299639) internal successors, (399), 277 states have internal predecessors, (399), 112 states have call successors, (112), 2 states have call predecessors, (112), 2 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) [2025-03-04 00:15:20,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 623 transitions. [2025-03-04 00:15:20,951 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 623 transitions. Word has length 366 [2025-03-04 00:15:20,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:15:20,952 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 623 transitions. [2025-03-04 00:15:20,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-03-04 00:15:20,953 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 623 transitions. [2025-03-04 00:15:20,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2025-03-04 00:15:20,956 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:15:20,956 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:20,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 00:15:20,956 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:15:20,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:15:20,958 INFO L85 PathProgramCache]: Analyzing trace with hash -962846341, now seen corresponding path program 1 times [2025-03-04 00:15:20,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:15:20,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715420421] [2025-03-04 00:15:20,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:15:20,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:15:20,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 366 statements into 1 equivalence classes. [2025-03-04 00:15:21,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 366 of 366 statements. [2025-03-04 00:15:21,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:15:21,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:15:21,954 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2025-03-04 00:15:21,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:15:21,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715420421] [2025-03-04 00:15:21,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715420421] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:15:21,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:15:21,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 00:15:21,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243783257] [2025-03-04 00:15:21,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:15:21,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 00:15:21,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:15:21,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 00:15:21,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-04 00:15:21,959 INFO L87 Difference]: Start difference. First operand 392 states and 623 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-03-04 00:15:22,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:15:22,768 INFO L93 Difference]: Finished difference Result 1422 states and 2257 transitions. [2025-03-04 00:15:22,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 00:15:22,769 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) Word has length 366 [2025-03-04 00:15:22,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:15:22,774 INFO L225 Difference]: With dead ends: 1422 [2025-03-04 00:15:22,774 INFO L226 Difference]: Without dead ends: 1033 [2025-03-04 00:15:22,776 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-04 00:15:22,776 INFO L435 NwaCegarLoop]: 549 mSDtfsCounter, 1062 mSDsluCounter, 1003 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 271 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1062 SdHoareTripleChecker+Valid, 1552 SdHoareTripleChecker+Invalid, 687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 271 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 00:15:22,776 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1062 Valid, 1552 Invalid, 687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [271 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 00:15:22,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1033 states. [2025-03-04 00:15:22,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1033 to 771. [2025-03-04 00:15:22,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 771 states, 550 states have (on average 1.4363636363636363) internal successors, (790), 551 states have internal predecessors, (790), 216 states have call successors, (216), 4 states have call predecessors, (216), 4 states have return successors, (216), 215 states have call predecessors, (216), 216 states have call successors, (216) [2025-03-04 00:15:22,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 1222 transitions. [2025-03-04 00:15:22,866 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 1222 transitions. Word has length 366 [2025-03-04 00:15:22,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:15:22,867 INFO L471 AbstractCegarLoop]: Abstraction has 771 states and 1222 transitions. [2025-03-04 00:15:22,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-03-04 00:15:22,868 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 1222 transitions. [2025-03-04 00:15:22,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2025-03-04 00:15:22,872 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:15:22,872 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:22,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 00:15:22,872 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:15:22,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:15:22,873 INFO L85 PathProgramCache]: Analyzing trace with hash 648746571, now seen corresponding path program 1 times [2025-03-04 00:15:22,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:15:22,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364489415] [2025-03-04 00:15:22,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:15:22,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:15:22,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 367 statements into 1 equivalence classes. [2025-03-04 00:15:23,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 367 of 367 statements. [2025-03-04 00:15:23,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:15:23,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:15:23,574 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2025-03-04 00:15:23,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:15:23,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364489415] [2025-03-04 00:15:23,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364489415] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:15:23,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:15:23,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:15:23,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014838941] [2025-03-04 00:15:23,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:15:23,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:15:23,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:15:23,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:15:23,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:15:23,577 INFO L87 Difference]: Start difference. First operand 771 states and 1222 transitions. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-03-04 00:15:23,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:15:23,938 INFO L93 Difference]: Finished difference Result 2835 states and 4486 transitions. [2025-03-04 00:15:23,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:15:23,939 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) Word has length 367 [2025-03-04 00:15:23,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:15:23,952 INFO L225 Difference]: With dead ends: 2835 [2025-03-04 00:15:23,952 INFO L226 Difference]: Without dead ends: 2067 [2025-03-04 00:15:23,955 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:15:23,956 INFO L435 NwaCegarLoop]: 434 mSDtfsCounter, 526 mSDsluCounter, 696 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 526 SdHoareTripleChecker+Valid, 1130 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:15:23,956 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [526 Valid, 1130 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 00:15:23,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2067 states. [2025-03-04 00:15:24,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2067 to 1619. [2025-03-04 00:15:24,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1619 states, 1234 states have (on average 1.46677471636953) internal successors, (1810), 1239 states have internal predecessors, (1810), 376 states have call successors, (376), 8 states have call predecessors, (376), 8 states have return successors, (376), 371 states have call predecessors, (376), 376 states have call successors, (376) [2025-03-04 00:15:24,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1619 states to 1619 states and 2562 transitions. [2025-03-04 00:15:24,069 INFO L78 Accepts]: Start accepts. Automaton has 1619 states and 2562 transitions. Word has length 367 [2025-03-04 00:15:24,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:15:24,069 INFO L471 AbstractCegarLoop]: Abstraction has 1619 states and 2562 transitions. [2025-03-04 00:15:24,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-03-04 00:15:24,070 INFO L276 IsEmpty]: Start isEmpty. Operand 1619 states and 2562 transitions. [2025-03-04 00:15:24,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2025-03-04 00:15:24,073 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:15:24,073 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:24,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 00:15:24,073 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:15:24,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:15:24,074 INFO L85 PathProgramCache]: Analyzing trace with hash 408206442, now seen corresponding path program 1 times [2025-03-04 00:15:24,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:15:24,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044384387] [2025-03-04 00:15:24,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:15:24,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:15:24,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 367 statements into 1 equivalence classes. [2025-03-04 00:15:24,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 367 of 367 statements. [2025-03-04 00:15:24,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:15:24,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:15:24,438 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2025-03-04 00:15:24,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:15:24,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044384387] [2025-03-04 00:15:24,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044384387] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:15:24,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:15:24,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:15:24,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996413925] [2025-03-04 00:15:24,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:15:24,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:15:24,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:15:24,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:15:24,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:15:24,441 INFO L87 Difference]: Start difference. First operand 1619 states and 2562 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-03-04 00:15:24,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:15:24,651 INFO L93 Difference]: Finished difference Result 4067 states and 6443 transitions. [2025-03-04 00:15:24,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:15:24,651 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) Word has length 367 [2025-03-04 00:15:24,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:15:24,669 INFO L225 Difference]: With dead ends: 4067 [2025-03-04 00:15:24,670 INFO L226 Difference]: Without dead ends: 2451 [2025-03-04 00:15:24,676 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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:15:24,678 INFO L435 NwaCegarLoop]: 458 mSDtfsCounter, 214 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 755 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:15:24,679 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 755 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:15:24,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2451 states. [2025-03-04 00:15:24,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2451 to 2449. [2025-03-04 00:15:24,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2449 states, 1803 states have (on average 1.442595673876872) internal successors, (2601), 1810 states have internal predecessors, (2601), 632 states have call successors, (632), 13 states have call predecessors, (632), 13 states have return successors, (632), 625 states have call predecessors, (632), 632 states have call successors, (632) [2025-03-04 00:15:24,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2449 states to 2449 states and 3865 transitions. [2025-03-04 00:15:24,924 INFO L78 Accepts]: Start accepts. Automaton has 2449 states and 3865 transitions. Word has length 367 [2025-03-04 00:15:24,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:15:24,925 INFO L471 AbstractCegarLoop]: Abstraction has 2449 states and 3865 transitions. [2025-03-04 00:15:24,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-03-04 00:15:24,925 INFO L276 IsEmpty]: Start isEmpty. Operand 2449 states and 3865 transitions. [2025-03-04 00:15:24,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2025-03-04 00:15:24,928 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:15:24,929 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:24,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 00:15:24,929 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:15:24,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:15:24,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1684648220, now seen corresponding path program 1 times [2025-03-04 00:15:24,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:15:24,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826988585] [2025-03-04 00:15:24,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:15:24,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:15:24,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 368 statements into 1 equivalence classes. [2025-03-04 00:15:24,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 368 of 368 statements. [2025-03-04 00:15:24,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:15:24,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:15:25,228 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2025-03-04 00:15:25,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:15:25,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826988585] [2025-03-04 00:15:25,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826988585] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:15:25,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:15:25,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:15:25,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821486157] [2025-03-04 00:15:25,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:15:25,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:15:25,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:15:25,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:15:25,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:15:25,230 INFO L87 Difference]: Start difference. First operand 2449 states and 3865 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-03-04 00:15:25,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:15:25,501 INFO L93 Difference]: Finished difference Result 6263 states and 9885 transitions. [2025-03-04 00:15:25,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:15:25,503 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) Word has length 368 [2025-03-04 00:15:25,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:15:25,527 INFO L225 Difference]: With dead ends: 6263 [2025-03-04 00:15:25,527 INFO L226 Difference]: Without dead ends: 3885 [2025-03-04 00:15:25,534 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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:15:25,535 INFO L435 NwaCegarLoop]: 417 mSDtfsCounter, 196 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 715 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:15:25,536 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 715 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:15:25,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3885 states. [2025-03-04 00:15:25,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3885 to 3883. [2025-03-04 00:15:25,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3883 states, 2853 states have (on average 1.4332281808622502) internal successors, (4089), 2865 states have internal predecessors, (4089), 1008 states have call successors, (1008), 21 states have call predecessors, (1008), 21 states have return successors, (1008), 996 states have call predecessors, (1008), 1008 states have call successors, (1008) [2025-03-04 00:15:25,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3883 states to 3883 states and 6105 transitions. [2025-03-04 00:15:25,831 INFO L78 Accepts]: Start accepts. Automaton has 3883 states and 6105 transitions. Word has length 368 [2025-03-04 00:15:25,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:15:25,832 INFO L471 AbstractCegarLoop]: Abstraction has 3883 states and 6105 transitions. [2025-03-04 00:15:25,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-03-04 00:15:25,832 INFO L276 IsEmpty]: Start isEmpty. Operand 3883 states and 6105 transitions. [2025-03-04 00:15:25,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2025-03-04 00:15:25,835 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:15:25,835 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:25,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 00:15:25,836 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:15:25,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:15:25,836 INFO L85 PathProgramCache]: Analyzing trace with hash 631197097, now seen corresponding path program 1 times [2025-03-04 00:15:25,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:15:25,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097753183] [2025-03-04 00:15:25,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:15:25,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:15:25,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 368 statements into 1 equivalence classes. [2025-03-04 00:15:26,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 368 of 368 statements. [2025-03-04 00:15:26,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:15:26,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:15:26,804 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 165 refuted. 0 times theorem prover too weak. 5995 trivial. 0 not checked. [2025-03-04 00:15:26,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:15:26,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097753183] [2025-03-04 00:15:26,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097753183] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:15:26,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [382974175] [2025-03-04 00:15:26,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:15:26,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:15:26,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:15:26,807 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:15:26,809 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:15:26,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 368 statements into 1 equivalence classes. [2025-03-04 00:15:27,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 368 of 368 statements. [2025-03-04 00:15:27,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:15:27,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:15:27,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 837 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 00:15:27,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:15:27,155 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 1329 proven. 18 refuted. 0 times theorem prover too weak. 4813 trivial. 0 not checked. [2025-03-04 00:15:27,156 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:15:27,442 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 147 proven. 18 refuted. 0 times theorem prover too weak. 5995 trivial. 0 not checked. [2025-03-04 00:15:27,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [382974175] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:15:27,445 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:15:27,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 12 [2025-03-04 00:15:27,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821835828] [2025-03-04 00:15:27,446 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:15:27,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 00:15:27,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:15:27,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 00:15:27,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-03-04 00:15:27,447 INFO L87 Difference]: Start difference. First operand 3883 states and 6105 transitions. Second operand has 12 states, 12 states have (on average 13.5) internal successors, (162), 12 states have internal predecessors, (162), 3 states have call successors, (117), 2 states have call predecessors, (117), 4 states have return successors, (119), 3 states have call predecessors, (119), 3 states have call successors, (119) [2025-03-04 00:15:29,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:15:29,002 INFO L93 Difference]: Finished difference Result 8134 states and 12711 transitions. [2025-03-04 00:15:29,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 00:15:29,003 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 13.5) internal successors, (162), 12 states have internal predecessors, (162), 3 states have call successors, (117), 2 states have call predecessors, (117), 4 states have return successors, (119), 3 states have call predecessors, (119), 3 states have call successors, (119) Word has length 368 [2025-03-04 00:15:29,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:15:29,024 INFO L225 Difference]: With dead ends: 8134 [2025-03-04 00:15:29,025 INFO L226 Difference]: Without dead ends: 4208 [2025-03-04 00:15:29,035 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 761 GetRequests, 737 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2025-03-04 00:15:29,036 INFO L435 NwaCegarLoop]: 349 mSDtfsCounter, 1038 mSDsluCounter, 1425 mSDsCounter, 0 mSdLazyCounter, 1571 mSolverCounterSat, 256 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1039 SdHoareTripleChecker+Valid, 1774 SdHoareTripleChecker+Invalid, 1827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 256 IncrementalHoareTripleChecker+Valid, 1571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:15:29,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1039 Valid, 1774 Invalid, 1827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [256 Valid, 1571 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-04 00:15:29,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4208 states. [2025-03-04 00:15:29,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4208 to 3421. [2025-03-04 00:15:29,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3421 states, 2595 states have (on average 1.4354527938342967) internal successors, (3725), 2602 states have internal predecessors, (3725), 784 states have call successors, (784), 41 states have call predecessors, (784), 41 states have return successors, (784), 777 states have call predecessors, (784), 784 states have call successors, (784) [2025-03-04 00:15:29,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3421 states to 3421 states and 5293 transitions. [2025-03-04 00:15:29,261 INFO L78 Accepts]: Start accepts. Automaton has 3421 states and 5293 transitions. Word has length 368 [2025-03-04 00:15:29,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:15:29,262 INFO L471 AbstractCegarLoop]: Abstraction has 3421 states and 5293 transitions. [2025-03-04 00:15:29,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 13.5) internal successors, (162), 12 states have internal predecessors, (162), 3 states have call successors, (117), 2 states have call predecessors, (117), 4 states have return successors, (119), 3 states have call predecessors, (119), 3 states have call successors, (119) [2025-03-04 00:15:29,263 INFO L276 IsEmpty]: Start isEmpty. Operand 3421 states and 5293 transitions. [2025-03-04 00:15:29,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2025-03-04 00:15:29,265 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:15:29,265 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:29,274 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:15:29,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-03-04 00:15:29,466 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:15:29,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:15:29,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1516603290, now seen corresponding path program 1 times [2025-03-04 00:15:29,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:15:29,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227590983] [2025-03-04 00:15:29,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:15:29,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:15:29,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 369 statements into 1 equivalence classes. [2025-03-04 00:15:29,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 369 of 369 statements. [2025-03-04 00:15:29,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:15:29,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:15:30,407 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 6 proven. 159 refuted. 0 times theorem prover too weak. 5995 trivial. 0 not checked. [2025-03-04 00:15:30,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:15:30,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227590983] [2025-03-04 00:15:30,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227590983] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:15:30,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1858639843] [2025-03-04 00:15:30,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:15:30,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:15:30,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:15:30,412 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:15:30,414 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:15:30,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 369 statements into 1 equivalence classes. [2025-03-04 00:15:30,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 369 of 369 statements. [2025-03-04 00:15:30,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:15:30,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:15:30,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 843 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 00:15:30,611 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:15:32,392 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 2905 proven. 267 refuted. 0 times theorem prover too weak. 2988 trivial. 0 not checked. [2025-03-04 00:15:32,393 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:15:32,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1858639843] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:15:32,776 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 00:15:32,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 14 [2025-03-04 00:15:32,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141827459] [2025-03-04 00:15:32,776 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 00:15:32,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 00:15:32,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:15:32,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 00:15:32,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2025-03-04 00:15:32,777 INFO L87 Difference]: Start difference. First operand 3421 states and 5293 transitions. Second operand has 14 states, 14 states have (on average 12.0) internal successors, (168), 14 states have internal predecessors, (168), 6 states have call successors, (109), 4 states have call predecessors, (109), 6 states have return successors, (109), 6 states have call predecessors, (109), 6 states have call successors, (109) [2025-03-04 00:15:35,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:15:35,200 INFO L93 Difference]: Finished difference Result 14503 states and 21770 transitions. [2025-03-04 00:15:35,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-03-04 00:15:35,201 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 12.0) internal successors, (168), 14 states have internal predecessors, (168), 6 states have call successors, (109), 4 states have call predecessors, (109), 6 states have return successors, (109), 6 states have call predecessors, (109), 6 states have call successors, (109) Word has length 369 [2025-03-04 00:15:35,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:15:35,249 INFO L225 Difference]: With dead ends: 14503 [2025-03-04 00:15:35,249 INFO L226 Difference]: Without dead ends: 11157 [2025-03-04 00:15:35,261 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 694 GetRequests, 647 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 433 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=657, Invalid=1695, Unknown=0, NotChecked=0, Total=2352 [2025-03-04 00:15:35,262 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 1579 mSDsluCounter, 1100 mSDsCounter, 0 mSdLazyCounter, 1445 mSolverCounterSat, 209 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1579 SdHoareTripleChecker+Valid, 1328 SdHoareTripleChecker+Invalid, 1654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 1445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-04 00:15:35,262 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1579 Valid, 1328 Invalid, 1654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [209 Valid, 1445 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-04 00:15:35,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11157 states. [2025-03-04 00:15:35,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11157 to 6421. [2025-03-04 00:15:35,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6421 states, 5454 states have (on average 1.4453612027869454) internal successors, (7883), 5476 states have internal predecessors, (7883), 814 states have call successors, (814), 152 states have call predecessors, (814), 152 states have return successors, (814), 792 states have call predecessors, (814), 814 states have call successors, (814) [2025-03-04 00:15:35,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6421 states to 6421 states and 9511 transitions. [2025-03-04 00:15:35,633 INFO L78 Accepts]: Start accepts. Automaton has 6421 states and 9511 transitions. Word has length 369 [2025-03-04 00:15:35,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:15:35,635 INFO L471 AbstractCegarLoop]: Abstraction has 6421 states and 9511 transitions. [2025-03-04 00:15:35,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 12.0) internal successors, (168), 14 states have internal predecessors, (168), 6 states have call successors, (109), 4 states have call predecessors, (109), 6 states have return successors, (109), 6 states have call predecessors, (109), 6 states have call successors, (109) [2025-03-04 00:15:35,639 INFO L276 IsEmpty]: Start isEmpty. Operand 6421 states and 9511 transitions. [2025-03-04 00:15:35,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2025-03-04 00:15:35,644 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:15:35,644 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:35,652 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:15:35,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:15:35,845 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:15:35,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:15:35,846 INFO L85 PathProgramCache]: Analyzing trace with hash 711408938, now seen corresponding path program 1 times [2025-03-04 00:15:35,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:15:35,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538768665] [2025-03-04 00:15:35,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:15:35,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:15:35,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 370 statements into 1 equivalence classes. [2025-03-04 00:15:36,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 370 of 370 statements. [2025-03-04 00:15:36,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:15:36,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:15:36,625 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 6 proven. 159 refuted. 0 times theorem prover too weak. 5995 trivial. 0 not checked. [2025-03-04 00:15:36,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:15:36,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538768665] [2025-03-04 00:15:36,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538768665] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:15:36,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [440881219] [2025-03-04 00:15:36,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:15:36,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:15:36,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:15:36,627 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:15:36,629 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:15:36,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 370 statements into 1 equivalence classes. [2025-03-04 00:15:36,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 370 of 370 statements. [2025-03-04 00:15:36,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:15:36,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:15:36,824 INFO L256 TraceCheckSpWp]: Trace formula consists of 844 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-04 00:15:36,831 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:15:39,550 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 3689 proven. 804 refuted. 0 times theorem prover too weak. 1667 trivial. 0 not checked. [2025-03-04 00:15:39,551 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:15:41,134 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 132 proven. 510 refuted. 0 times theorem prover too weak. 5518 trivial. 0 not checked. [2025-03-04 00:15:41,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [440881219] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:15:41,135 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:15:41,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 25, 17] total 45 [2025-03-04 00:15:41,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037701810] [2025-03-04 00:15:41,135 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:15:41,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-03-04 00:15:41,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:15:41,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-03-04 00:15:41,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=454, Invalid=1526, Unknown=0, NotChecked=0, Total=1980 [2025-03-04 00:15:41,137 INFO L87 Difference]: Start difference. First operand 6421 states and 9511 transitions. Second operand has 45 states, 43 states have (on average 6.27906976744186) internal successors, (270), 41 states have internal predecessors, (270), 15 states have call successors, (162), 8 states have call predecessors, (162), 16 states have return successors, (163), 15 states have call predecessors, (163), 15 states have call successors, (163) [2025-03-04 00:15:48,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:15:48,220 INFO L93 Difference]: Finished difference Result 28444 states and 40847 transitions. [2025-03-04 00:15:48,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2025-03-04 00:15:48,222 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 43 states have (on average 6.27906976744186) internal successors, (270), 41 states have internal predecessors, (270), 15 states have call successors, (162), 8 states have call predecessors, (162), 16 states have return successors, (163), 15 states have call predecessors, (163), 15 states have call successors, (163) Word has length 370 [2025-03-04 00:15:48,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:15:48,275 INFO L225 Difference]: With dead ends: 28444 [2025-03-04 00:15:48,276 INFO L226 Difference]: Without dead ends: 22122 [2025-03-04 00:15:48,291 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 878 GetRequests, 727 SyntacticMatches, 0 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7549 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5350, Invalid=17906, Unknown=0, NotChecked=0, Total=23256 [2025-03-04 00:15:48,292 INFO L435 NwaCegarLoop]: 302 mSDtfsCounter, 3053 mSDsluCounter, 2610 mSDsCounter, 0 mSdLazyCounter, 4753 mSolverCounterSat, 746 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3053 SdHoareTripleChecker+Valid, 2912 SdHoareTripleChecker+Invalid, 5499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 746 IncrementalHoareTripleChecker+Valid, 4753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-03-04 00:15:48,292 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3053 Valid, 2912 Invalid, 5499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [746 Valid, 4753 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-03-04 00:15:48,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22122 states. [2025-03-04 00:15:49,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22122 to 9806. [2025-03-04 00:15:49,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9806 states, 7842 states have (on average 1.3889313950522826) internal successors, (10892), 7873 states have internal predecessors, (10892), 1546 states have call successors, (1546), 417 states have call predecessors, (1546), 417 states have return successors, (1546), 1515 states have call predecessors, (1546), 1546 states have call successors, (1546) [2025-03-04 00:15:49,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9806 states to 9806 states and 13984 transitions. [2025-03-04 00:15:49,418 INFO L78 Accepts]: Start accepts. Automaton has 9806 states and 13984 transitions. Word has length 370 [2025-03-04 00:15:49,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:15:49,419 INFO L471 AbstractCegarLoop]: Abstraction has 9806 states and 13984 transitions. [2025-03-04 00:15:49,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 43 states have (on average 6.27906976744186) internal successors, (270), 41 states have internal predecessors, (270), 15 states have call successors, (162), 8 states have call predecessors, (162), 16 states have return successors, (163), 15 states have call predecessors, (163), 15 states have call successors, (163) [2025-03-04 00:15:49,420 INFO L276 IsEmpty]: Start isEmpty. Operand 9806 states and 13984 transitions. [2025-03-04 00:15:49,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2025-03-04 00:15:49,437 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:15:49,438 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:49,447 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:15:49,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:15:49,639 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:15:49,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:15:49,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1831968804, now seen corresponding path program 1 times [2025-03-04 00:15:49,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:15:49,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880993531] [2025-03-04 00:15:49,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:15:49,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:15:49,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 371 statements into 1 equivalence classes. [2025-03-04 00:15:50,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 371 of 371 statements. [2025-03-04 00:15:50,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:15:50,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:15:50,834 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2025-03-04 00:15:50,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:15:50,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880993531] [2025-03-04 00:15:50,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880993531] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:15:50,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:15:50,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 00:15:50,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817939065] [2025-03-04 00:15:50,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:15:50,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 00:15:50,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:15:50,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 00:15:50,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 00:15:50,842 INFO L87 Difference]: Start difference. First operand 9806 states and 13984 transitions. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 2 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 2 states have call predecessors, (56), 2 states have call successors, (56) [2025-03-04 00:15:53,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:15:53,414 INFO L93 Difference]: Finished difference Result 30610 states and 43793 transitions. [2025-03-04 00:15:53,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 00:15:53,415 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 2 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 2 states have call predecessors, (56), 2 states have call successors, (56) Word has length 371 [2025-03-04 00:15:53,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:15:53,475 INFO L225 Difference]: With dead ends: 30610 [2025-03-04 00:15:53,476 INFO L226 Difference]: Without dead ends: 24150 [2025-03-04 00:15:53,491 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-04 00:15:53,492 INFO L435 NwaCegarLoop]: 469 mSDtfsCounter, 688 mSDsluCounter, 861 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 281 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 688 SdHoareTripleChecker+Valid, 1330 SdHoareTripleChecker+Invalid, 727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 281 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 00:15:53,493 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [688 Valid, 1330 Invalid, 727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [281 Valid, 446 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 00:15:53,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24150 states. [2025-03-04 00:15:55,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24150 to 24146. [2025-03-04 00:15:55,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24146 states, 19426 states have (on average 1.3934932564604139) internal successors, (27070), 19501 states have internal predecessors, (27070), 3714 states have call successors, (3714), 1005 states have call predecessors, (3714), 1005 states have return successors, (3714), 3639 states have call predecessors, (3714), 3714 states have call successors, (3714) [2025-03-04 00:15:55,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24146 states to 24146 states and 34498 transitions. [2025-03-04 00:15:55,702 INFO L78 Accepts]: Start accepts. Automaton has 24146 states and 34498 transitions. Word has length 371 [2025-03-04 00:15:55,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:15:55,704 INFO L471 AbstractCegarLoop]: Abstraction has 24146 states and 34498 transitions. [2025-03-04 00:15:55,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 2 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 2 states have call predecessors, (56), 2 states have call successors, (56) [2025-03-04 00:15:55,704 INFO L276 IsEmpty]: Start isEmpty. Operand 24146 states and 34498 transitions. [2025-03-04 00:15:55,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2025-03-04 00:15:55,711 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:15:55,712 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:55,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 00:15:55,712 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:15:55,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:15:55,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1538565797, now seen corresponding path program 1 times [2025-03-04 00:15:55,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:15:55,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505808262] [2025-03-04 00:15:55,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:15:55,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:15:55,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 371 statements into 1 equivalence classes. [2025-03-04 00:15:56,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 371 of 371 statements. [2025-03-04 00:15:56,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:15:56,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:15:56,952 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 81 proven. 243 refuted. 0 times theorem prover too weak. 5836 trivial. 0 not checked. [2025-03-04 00:15:56,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:15:56,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505808262] [2025-03-04 00:15:56,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505808262] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:15:56,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1890072235] [2025-03-04 00:15:56,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:15:56,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:15:56,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:15:56,955 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:15:56,957 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:15:57,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 371 statements into 1 equivalence classes. [2025-03-04 00:15:57,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 371 of 371 statements. [2025-03-04 00:15:57,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:15:57,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:15:57,205 INFO L256 TraceCheckSpWp]: Trace formula consists of 844 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-04 00:15:57,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:15:58,863 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 3744 proven. 432 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-03-04 00:15:58,863 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:16:00,275 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 192 proven. 450 refuted. 0 times theorem prover too weak. 5518 trivial. 0 not checked. [2025-03-04 00:16:00,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1890072235] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:16:00,275 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:16:00,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 15, 15] total 31 [2025-03-04 00:16:00,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628726253] [2025-03-04 00:16:00,275 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:16:00,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-04 00:16:00,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:16:00,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-04 00:16:00,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=269, Invalid=661, Unknown=0, NotChecked=0, Total=930 [2025-03-04 00:16:00,280 INFO L87 Difference]: Start difference. First operand 24146 states and 34498 transitions. Second operand has 31 states, 30 states have (on average 7.233333333333333) internal successors, (217), 29 states have internal predecessors, (217), 11 states have call successors, (162), 5 states have call predecessors, (162), 12 states have return successors, (163), 11 states have call predecessors, (163), 11 states have call successors, (163) [2025-03-04 00:16:03,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:16:03,672 INFO L93 Difference]: Finished difference Result 60512 states and 86115 transitions. [2025-03-04 00:16:03,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-04 00:16:03,673 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 7.233333333333333) internal successors, (217), 29 states have internal predecessors, (217), 11 states have call successors, (162), 5 states have call predecessors, (162), 12 states have return successors, (163), 11 states have call predecessors, (163), 11 states have call successors, (163) Word has length 371 [2025-03-04 00:16:03,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:16:03,764 INFO L225 Difference]: With dead ends: 60512 [2025-03-04 00:16:03,764 INFO L226 Difference]: Without dead ends: 36481 [2025-03-04 00:16:03,798 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 769 GetRequests, 725 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 525 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=665, Invalid=1405, Unknown=0, NotChecked=0, Total=2070 [2025-03-04 00:16:03,798 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 1039 mSDsluCounter, 938 mSDsCounter, 0 mSdLazyCounter, 1665 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1041 SdHoareTripleChecker+Valid, 1123 SdHoareTripleChecker+Invalid, 1765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 1665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:16:03,799 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1041 Valid, 1123 Invalid, 1765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 1665 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-04 00:16:03,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36481 states. [2025-03-04 00:16:05,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36481 to 14294. [2025-03-04 00:16:05,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14294 states, 11863 states have (on average 1.3814380848014836) internal successors, (16388), 11880 states have internal predecessors, (16388), 1856 states have call successors, (1856), 574 states have call predecessors, (1856), 574 states have return successors, (1856), 1839 states have call predecessors, (1856), 1856 states have call successors, (1856) [2025-03-04 00:16:05,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14294 states to 14294 states and 20100 transitions. [2025-03-04 00:16:05,419 INFO L78 Accepts]: Start accepts. Automaton has 14294 states and 20100 transitions. Word has length 371 [2025-03-04 00:16:05,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:16:05,420 INFO L471 AbstractCegarLoop]: Abstraction has 14294 states and 20100 transitions. [2025-03-04 00:16:05,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 7.233333333333333) internal successors, (217), 29 states have internal predecessors, (217), 11 states have call successors, (162), 5 states have call predecessors, (162), 12 states have return successors, (163), 11 states have call predecessors, (163), 11 states have call successors, (163) [2025-03-04 00:16:05,420 INFO L276 IsEmpty]: Start isEmpty. Operand 14294 states and 20100 transitions. [2025-03-04 00:16:05,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2025-03-04 00:16:05,425 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:16:05,425 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16:05,434 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 00:16:05,626 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,SelfDestructingSolverStorable11 [2025-03-04 00:16:05,626 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:16:05,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:16:05,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1510162774, now seen corresponding path program 1 times [2025-03-04 00:16:05,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:16:05,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459693916] [2025-03-04 00:16:05,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:16:05,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:16:05,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 372 statements into 1 equivalence classes. [2025-03-04 00:16:05,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 372 of 372 statements. [2025-03-04 00:16:05,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:16:05,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:16:06,822 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 318 proven. 159 refuted. 0 times theorem prover too weak. 5683 trivial. 0 not checked. [2025-03-04 00:16:06,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:16:06,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459693916] [2025-03-04 00:16:06,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459693916] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:16:06,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1890699388] [2025-03-04 00:16:06,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:16:06,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:16:06,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:16:06,825 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:16:06,827 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:16:06,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 372 statements into 1 equivalence classes. [2025-03-04 00:16:07,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 372 of 372 statements. [2025-03-04 00:16:07,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:16:07,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:16:07,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 844 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-04 00:16:07,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:16:08,455 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 4385 proven. 306 refuted. 0 times theorem prover too weak. 1469 trivial. 0 not checked. [2025-03-04 00:16:08,455 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:16:11,113 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 444 proven. 198 refuted. 0 times theorem prover too weak. 5518 trivial. 0 not checked. [2025-03-04 00:16:11,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1890699388] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:16:11,113 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:16:11,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 20, 17] total 41 [2025-03-04 00:16:11,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859342575] [2025-03-04 00:16:11,114 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:16:11,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-03-04 00:16:11,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:16:11,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-03-04 00:16:11,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=331, Invalid=1309, Unknown=0, NotChecked=0, Total=1640 [2025-03-04 00:16:11,116 INFO L87 Difference]: Start difference. First operand 14294 states and 20100 transitions. Second operand has 41 states, 38 states have (on average 6.2631578947368425) internal successors, (238), 36 states have internal predecessors, (238), 13 states have call successors, (125), 6 states have call predecessors, (125), 13 states have return successors, (127), 13 states have call predecessors, (127), 13 states have call successors, (127)