./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-74.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-74.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 81fdc30d5ae06f4aa0f8c63596e14b99f6ff7b82b4febb712a46f5be02949bcd --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:14:56,811 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:14:56,867 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 00:14:56,871 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:14:56,872 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:14:56,891 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:14:56,892 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:14:56,892 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:14:56,892 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:14:56,892 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:14:56,893 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:14:56,893 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:14:56,893 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:14:56,893 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:14:56,894 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:14:56,894 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:14:56,894 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:14:56,894 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:14:56,894 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 00:14:56,895 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:14:56,895 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:14:56,895 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:14:56,895 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:14:56,895 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:14:56,895 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:14:56,895 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:14:56,895 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:14:56,895 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:14:56,895 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:14:56,895 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:14:56,895 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:14:56,895 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:14:56,895 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:14:56,895 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:14:56,895 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:14:56,895 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:14:56,895 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:14:56,895 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 00:14:56,895 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 00:14:56,895 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:14:56,896 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:14:56,896 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:14:56,896 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:14:56,896 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 -> 81fdc30d5ae06f4aa0f8c63596e14b99f6ff7b82b4febb712a46f5be02949bcd [2025-03-04 00:14:57,124 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:14:57,133 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:14:57,135 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:14:57,136 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:14:57,137 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:14:57,138 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-74.i [2025-03-04 00:14:58,346 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be6e587f6/b4fca82b53d143ada03fcfe1242e6679/FLAG05c1b7ee0 [2025-03-04 00:14:58,690 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:14:58,691 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-74.i [2025-03-04 00:14:58,702 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be6e587f6/b4fca82b53d143ada03fcfe1242e6679/FLAG05c1b7ee0 [2025-03-04 00:14:58,718 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be6e587f6/b4fca82b53d143ada03fcfe1242e6679 [2025-03-04 00:14:58,721 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:14:58,722 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:14:58,724 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:14:58,724 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:14:58,727 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:14:58,729 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:14:58" (1/1) ... [2025-03-04 00:14:58,730 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ec8e47b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:14:58, skipping insertion in model container [2025-03-04 00:14:58,731 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:14:58" (1/1) ... [2025-03-04 00:14:58,756 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:14:58,873 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-74.i[916,929] [2025-03-04 00:14:58,982 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:14:58,994 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:14:59,004 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-74.i[916,929] [2025-03-04 00:14:59,058 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:14:59,072 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:14:59,072 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:14:59 WrapperNode [2025-03-04 00:14:59,073 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:14:59,074 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:14:59,074 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:14:59,074 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:14:59,079 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:14:59" (1/1) ... [2025-03-04 00:14:59,097 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:14:59" (1/1) ... [2025-03-04 00:14:59,145 INFO L138 Inliner]: procedures = 26, calls = 58, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 447 [2025-03-04 00:14:59,145 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:14:59,145 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:14:59,145 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:14:59,145 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:14:59,152 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:14:59" (1/1) ... [2025-03-04 00:14:59,152 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:14:59" (1/1) ... [2025-03-04 00:14:59,166 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:14:59" (1/1) ... [2025-03-04 00:14:59,199 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:14:59,199 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:14:59" (1/1) ... [2025-03-04 00:14:59,199 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:14:59" (1/1) ... [2025-03-04 00:14:59,222 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:14:59" (1/1) ... [2025-03-04 00:14:59,229 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:14:59" (1/1) ... [2025-03-04 00:14:59,235 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:14:59" (1/1) ... [2025-03-04 00:14:59,241 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:14:59" (1/1) ... [2025-03-04 00:14:59,250 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:14:59,252 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:14:59,252 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:14:59,252 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:14:59,254 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:14:59" (1/1) ... [2025-03-04 00:14:59,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:14:59,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:14:59,280 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:14:59,289 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:14:59,304 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:14:59,304 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:14:59,304 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:14:59,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 00:14:59,304 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:14:59,304 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:14:59,397 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:14:59,399 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:15:00,085 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L353: havoc property_#t~bitwise36#1;havoc property_#t~short37#1;havoc property_#t~bitwise38#1;havoc property_#t~short39#1;havoc property_#t~ite43#1;havoc property_#t~ite42#1;havoc property_#t~ite41#1;havoc property_#t~bitwise40#1;havoc property_#t~short44#1;havoc property_#t~ite46#1;havoc property_#t~bitwise45#1;havoc property_#t~short47#1; [2025-03-04 00:15:00,141 INFO L? ?]: Removed 57 outVars from TransFormulas that were not future-live. [2025-03-04 00:15:00,141 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:15:00,162 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:15:00,162 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-04 00:15:00,162 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:15:00 BoogieIcfgContainer [2025-03-04 00:15:00,162 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:15:00,166 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:15:00,166 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:15:00,169 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:15:00,170 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:14:58" (1/3) ... [2025-03-04 00:15:00,170 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b15076f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:15:00, skipping insertion in model container [2025-03-04 00:15:00,170 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:14:59" (2/3) ... [2025-03-04 00:15:00,170 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b15076f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:15:00, skipping insertion in model container [2025-03-04 00:15:00,170 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:15:00" (3/3) ... [2025-03-04 00:15:00,171 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-74.i [2025-03-04 00:15:00,182 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:15:00,184 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount250_file-74.i that has 2 procedures, 191 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:15:00,248 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:15:00,256 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;@176f1237, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:15:00,257 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:15:00,261 INFO L276 IsEmpty]: Start isEmpty. Operand has 191 states, 143 states have (on average 1.4895104895104896) internal successors, (213), 144 states have internal predecessors, (213), 45 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2025-03-04 00:15:00,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2025-03-04 00:15:00,276 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:15:00,276 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:15:00,277 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:15:00,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:15:00,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1001213493, now seen corresponding path program 1 times [2025-03-04 00:15:00,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:15:00,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189683729] [2025-03-04 00:15:00,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:15:00,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:15:00,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 310 statements into 1 equivalence classes. [2025-03-04 00:15:00,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 310 of 310 statements. [2025-03-04 00:15:00,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:15:00,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:15:00,697 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 0 proven. 88 refuted. 0 times theorem prover too weak. 3872 trivial. 0 not checked. [2025-03-04 00:15:00,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:15:00,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189683729] [2025-03-04 00:15:00,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189683729] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:15:00,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [484449213] [2025-03-04 00:15:00,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:15:00,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:15:00,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:15:00,702 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:00,703 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:00,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 310 statements into 1 equivalence classes. [2025-03-04 00:15:00,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 310 of 310 statements. [2025-03-04 00:15:00,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:15:00,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:15:00,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 720 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:15:00,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:15:00,955 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 3872 trivial. 0 not checked. [2025-03-04 00:15:00,956 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:15:00,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [484449213] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:15:00,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:15:00,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 00:15:00,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347050068] [2025-03-04 00:15:00,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:15:00,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:15:00,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:15:00,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:15:00,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:15:00,985 INFO L87 Difference]: Start difference. First operand has 191 states, 143 states have (on average 1.4895104895104896) internal successors, (213), 144 states have internal predecessors, (213), 45 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) Second operand has 2 states, 2 states have (on average 45.0) internal successors, (90), 2 states have internal predecessors, (90), 2 states have call successors, (45), 2 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 2 states have call successors, (45) [2025-03-04 00:15:01,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:15:01,030 INFO L93 Difference]: Finished difference Result 376 states and 646 transitions. [2025-03-04 00:15:01,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:15:01,032 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, (45), 2 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 2 states have call successors, (45) Word has length 310 [2025-03-04 00:15:01,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:15:01,037 INFO L225 Difference]: With dead ends: 376 [2025-03-04 00:15:01,037 INFO L226 Difference]: Without dead ends: 188 [2025-03-04 00:15:01,040 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 311 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:01,042 INFO L435 NwaCegarLoop]: 290 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, 290 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:01,042 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 290 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:01,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2025-03-04 00:15:01,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2025-03-04 00:15:01,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 141 states have (on average 1.475177304964539) internal successors, (208), 141 states have internal predecessors, (208), 45 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2025-03-04 00:15:01,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 298 transitions. [2025-03-04 00:15:01,084 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 298 transitions. Word has length 310 [2025-03-04 00:15:01,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:15:01,085 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 298 transitions. [2025-03-04 00:15:01,085 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, (45), 2 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 2 states have call successors, (45) [2025-03-04 00:15:01,086 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 298 transitions. [2025-03-04 00:15:01,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2025-03-04 00:15:01,091 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:15:01,091 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:15:01,099 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 00:15:01,296 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:01,296 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:15:01,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:15:01,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1835229106, now seen corresponding path program 1 times [2025-03-04 00:15:01,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:15:01,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775460356] [2025-03-04 00:15:01,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:15:01,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:15:01,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 310 statements into 1 equivalence classes. [2025-03-04 00:15:01,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 310 of 310 statements. [2025-03-04 00:15:01,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:15:01,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:15:01,641 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2025-03-04 00:15:01,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:15:01,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775460356] [2025-03-04 00:15:01,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775460356] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:15:01,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:15:01,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:15:01,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186903590] [2025-03-04 00:15:01,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:15:01,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:15:01,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:15:01,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:15:01,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:15:01,644 INFO L87 Difference]: Start difference. First operand 188 states and 298 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, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-03-04 00:15:01,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:15:01,779 INFO L93 Difference]: Finished difference Result 554 states and 880 transitions. [2025-03-04 00:15:01,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:15:01,780 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, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) Word has length 310 [2025-03-04 00:15:01,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:15:01,789 INFO L225 Difference]: With dead ends: 554 [2025-03-04 00:15:01,789 INFO L226 Difference]: Without dead ends: 369 [2025-03-04 00:15:01,790 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:01,791 INFO L435 NwaCegarLoop]: 488 mSDtfsCounter, 281 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 764 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:15:01,791 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 764 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:15:01,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2025-03-04 00:15:01,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 367. [2025-03-04 00:15:01,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 274 states have (on average 1.4598540145985401) internal successors, (400), 274 states have internal predecessors, (400), 90 states have call successors, (90), 2 states have call predecessors, (90), 2 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) [2025-03-04 00:15:01,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 580 transitions. [2025-03-04 00:15:01,831 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 580 transitions. Word has length 310 [2025-03-04 00:15:01,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:15:01,835 INFO L471 AbstractCegarLoop]: Abstraction has 367 states and 580 transitions. [2025-03-04 00:15:01,836 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, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-03-04 00:15:01,836 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 580 transitions. [2025-03-04 00:15:01,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2025-03-04 00:15:01,843 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:15:01,843 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:15:01,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 00:15:01,843 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:15:01,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:15:01,844 INFO L85 PathProgramCache]: Analyzing trace with hash -202827183, now seen corresponding path program 1 times [2025-03-04 00:15:01,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:15:01,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509563149] [2025-03-04 00:15:01,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:15:01,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:15:01,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 310 statements into 1 equivalence classes. [2025-03-04 00:15:01,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 310 of 310 statements. [2025-03-04 00:15:01,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:15:01,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:15:02,515 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2025-03-04 00:15:02,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:15:02,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509563149] [2025-03-04 00:15:02,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509563149] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:15:02,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:15:02,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:15:02,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918679318] [2025-03-04 00:15:02,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:15:02,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:15:02,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:15:02,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:15:02,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:15:02,520 INFO L87 Difference]: Start difference. First operand 367 states and 580 transitions. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-03-04 00:15:02,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:15:02,876 INFO L93 Difference]: Finished difference Result 1285 states and 2012 transitions. [2025-03-04 00:15:02,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 00:15:02,877 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) Word has length 310 [2025-03-04 00:15:02,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:15:02,886 INFO L225 Difference]: With dead ends: 1285 [2025-03-04 00:15:02,886 INFO L226 Difference]: Without dead ends: 921 [2025-03-04 00:15:02,888 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:15:02,890 INFO L435 NwaCegarLoop]: 342 mSDtfsCounter, 446 mSDsluCounter, 607 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 949 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:15:02,890 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [446 Valid, 949 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 00:15:02,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2025-03-04 00:15:02,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 630. [2025-03-04 00:15:02,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 630 states, 445 states have (on average 1.397752808988764) internal successors, (622), 445 states have internal predecessors, (622), 180 states have call successors, (180), 4 states have call predecessors, (180), 4 states have return successors, (180), 180 states have call predecessors, (180), 180 states have call successors, (180) [2025-03-04 00:15:02,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 982 transitions. [2025-03-04 00:15:02,983 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 982 transitions. Word has length 310 [2025-03-04 00:15:02,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:15:02,984 INFO L471 AbstractCegarLoop]: Abstraction has 630 states and 982 transitions. [2025-03-04 00:15:02,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-03-04 00:15:02,984 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 982 transitions. [2025-03-04 00:15:02,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2025-03-04 00:15:02,989 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:15:02,989 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:15:02,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 00:15:02,989 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:15:02,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:15:02,990 INFO L85 PathProgramCache]: Analyzing trace with hash 660977149, now seen corresponding path program 1 times [2025-03-04 00:15:02,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:15:02,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772852078] [2025-03-04 00:15:02,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:15:02,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:15:03,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 311 statements into 1 equivalence classes. [2025-03-04 00:15:03,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 311 of 311 statements. [2025-03-04 00:15:03,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:15:03,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:15:03,454 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2025-03-04 00:15:03,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:15:03,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772852078] [2025-03-04 00:15:03,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772852078] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:15:03,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:15:03,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:15:03,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805276024] [2025-03-04 00:15:03,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:15:03,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:15:03,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:15:03,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:15:03,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:15:03,459 INFO L87 Difference]: Start difference. First operand 630 states and 982 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-03-04 00:15:03,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:15:03,788 INFO L93 Difference]: Finished difference Result 1586 states and 2464 transitions. [2025-03-04 00:15:03,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:15:03,789 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) Word has length 311 [2025-03-04 00:15:03,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:15:03,798 INFO L225 Difference]: With dead ends: 1586 [2025-03-04 00:15:03,799 INFO L226 Difference]: Without dead ends: 959 [2025-03-04 00:15:03,802 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:15:03,804 INFO L435 NwaCegarLoop]: 283 mSDtfsCounter, 266 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 837 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:15:03,805 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 837 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 00:15:03,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2025-03-04 00:15:03,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 825. [2025-03-04 00:15:03,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 825 states, 594 states have (on average 1.4158249158249159) internal successors, (841), 594 states have internal predecessors, (841), 225 states have call successors, (225), 5 states have call predecessors, (225), 5 states have return successors, (225), 225 states have call predecessors, (225), 225 states have call successors, (225) [2025-03-04 00:15:03,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 825 states to 825 states and 1291 transitions. [2025-03-04 00:15:03,895 INFO L78 Accepts]: Start accepts. Automaton has 825 states and 1291 transitions. Word has length 311 [2025-03-04 00:15:03,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:15:03,896 INFO L471 AbstractCegarLoop]: Abstraction has 825 states and 1291 transitions. [2025-03-04 00:15:03,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-03-04 00:15:03,896 INFO L276 IsEmpty]: Start isEmpty. Operand 825 states and 1291 transitions. [2025-03-04 00:15:03,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2025-03-04 00:15:03,900 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:15:03,900 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:15:03,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 00:15:03,900 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:15:03,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:15:03,901 INFO L85 PathProgramCache]: Analyzing trace with hash -336305742, now seen corresponding path program 1 times [2025-03-04 00:15:03,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:15:03,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459556409] [2025-03-04 00:15:03,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:15:03,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:15:03,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 312 statements into 1 equivalence classes. [2025-03-04 00:15:03,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 312 of 312 statements. [2025-03-04 00:15:03,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:15:03,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:15:04,276 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2025-03-04 00:15:04,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:15:04,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459556409] [2025-03-04 00:15:04,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459556409] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:15:04,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:15:04,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:15:04,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348616606] [2025-03-04 00:15:04,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:15:04,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:15:04,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:15:04,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:15:04,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:15:04,279 INFO L87 Difference]: Start difference. First operand 825 states and 1291 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, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-03-04 00:15:04,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:15:04,591 INFO L93 Difference]: Finished difference Result 1697 states and 2638 transitions. [2025-03-04 00:15:04,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:15:04,592 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, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) Word has length 312 [2025-03-04 00:15:04,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:15:04,598 INFO L225 Difference]: With dead ends: 1697 [2025-03-04 00:15:04,598 INFO L226 Difference]: Without dead ends: 959 [2025-03-04 00:15:04,600 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:15:04,601 INFO L435 NwaCegarLoop]: 285 mSDtfsCounter, 262 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 840 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:15:04,602 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 840 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 00:15:04,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2025-03-04 00:15:04,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 829. [2025-03-04 00:15:04,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 829 states, 598 states have (on average 1.411371237458194) internal successors, (844), 598 states have internal predecessors, (844), 225 states have call successors, (225), 5 states have call predecessors, (225), 5 states have return successors, (225), 225 states have call predecessors, (225), 225 states have call successors, (225) [2025-03-04 00:15:04,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 1294 transitions. [2025-03-04 00:15:04,689 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 1294 transitions. Word has length 312 [2025-03-04 00:15:04,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:15:04,690 INFO L471 AbstractCegarLoop]: Abstraction has 829 states and 1294 transitions. [2025-03-04 00:15:04,690 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, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-03-04 00:15:04,691 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 1294 transitions. [2025-03-04 00:15:04,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2025-03-04 00:15:04,695 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:15:04,696 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:15:04,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 00:15:04,696 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:15:04,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:15:04,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1272400934, now seen corresponding path program 1 times [2025-03-04 00:15:04,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:15:04,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162601179] [2025-03-04 00:15:04,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:15:04,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:15:04,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 313 statements into 1 equivalence classes. [2025-03-04 00:15:04,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 313 of 313 statements. [2025-03-04 00:15:04,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:15:04,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:15:05,173 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2025-03-04 00:15:05,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:15:05,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162601179] [2025-03-04 00:15:05,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162601179] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:15:05,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:15:05,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:15:05,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506424099] [2025-03-04 00:15:05,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:15:05,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:15:05,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:15:05,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:15:05,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:15:05,175 INFO L87 Difference]: Start difference. First operand 829 states and 1294 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-03-04 00:15:05,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:15:05,580 INFO L93 Difference]: Finished difference Result 2014 states and 3119 transitions. [2025-03-04 00:15:05,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:15:05,581 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) Word has length 313 [2025-03-04 00:15:05,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:15:05,594 INFO L225 Difference]: With dead ends: 2014 [2025-03-04 00:15:05,594 INFO L226 Difference]: Without dead ends: 1340 [2025-03-04 00:15:05,597 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:15:05,598 INFO L435 NwaCegarLoop]: 481 mSDtfsCounter, 284 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 1023 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:15:05,599 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 1023 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 00:15:05,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1340 states. [2025-03-04 00:15:05,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1340 to 1138. [2025-03-04 00:15:05,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1138 states, 851 states have (on average 1.4136310223266746) internal successors, (1203), 853 states have internal predecessors, (1203), 277 states have call successors, (277), 9 states have call predecessors, (277), 9 states have return successors, (277), 275 states have call predecessors, (277), 277 states have call successors, (277) [2025-03-04 00:15:05,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1138 states to 1138 states and 1757 transitions. [2025-03-04 00:15:05,699 INFO L78 Accepts]: Start accepts. Automaton has 1138 states and 1757 transitions. Word has length 313 [2025-03-04 00:15:05,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:15:05,699 INFO L471 AbstractCegarLoop]: Abstraction has 1138 states and 1757 transitions. [2025-03-04 00:15:05,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-03-04 00:15:05,700 INFO L276 IsEmpty]: Start isEmpty. Operand 1138 states and 1757 transitions. [2025-03-04 00:15:05,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2025-03-04 00:15:05,705 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:15:05,705 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:15:05,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 00:15:05,706 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:15:05,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:15:05,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1339407687, now seen corresponding path program 1 times [2025-03-04 00:15:05,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:15:05,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940445055] [2025-03-04 00:15:05,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:15:05,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:15:05,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 313 statements into 1 equivalence classes. [2025-03-04 00:15:05,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 313 of 313 statements. [2025-03-04 00:15:05,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:15:05,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:15:05,997 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2025-03-04 00:15:05,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:15:05,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940445055] [2025-03-04 00:15:05,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940445055] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:15:05,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:15:05,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:15:06,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206932426] [2025-03-04 00:15:06,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:15:06,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:15:06,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:15:06,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:15:06,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:15:06,002 INFO L87 Difference]: Start difference. First operand 1138 states and 1757 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, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-03-04 00:15:06,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:15:06,135 INFO L93 Difference]: Finished difference Result 2515 states and 3886 transitions. [2025-03-04 00:15:06,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:15:06,136 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, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) Word has length 313 [2025-03-04 00:15:06,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:15:06,146 INFO L225 Difference]: With dead ends: 2515 [2025-03-04 00:15:06,146 INFO L226 Difference]: Without dead ends: 1598 [2025-03-04 00:15:06,150 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:06,150 INFO L435 NwaCegarLoop]: 364 mSDtfsCounter, 184 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:15:06,151 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 638 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:15:06,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1598 states. [2025-03-04 00:15:06,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1598 to 1596. [2025-03-04 00:15:06,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1596 states, 1189 states have (on average 1.4121110176619007) internal successors, (1679), 1192 states have internal predecessors, (1679), 393 states have call successors, (393), 13 states have call predecessors, (393), 13 states have return successors, (393), 390 states have call predecessors, (393), 393 states have call successors, (393) [2025-03-04 00:15:06,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1596 states to 1596 states and 2465 transitions. [2025-03-04 00:15:06,262 INFO L78 Accepts]: Start accepts. Automaton has 1596 states and 2465 transitions. Word has length 313 [2025-03-04 00:15:06,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:15:06,263 INFO L471 AbstractCegarLoop]: Abstraction has 1596 states and 2465 transitions. [2025-03-04 00:15:06,263 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, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-03-04 00:15:06,264 INFO L276 IsEmpty]: Start isEmpty. Operand 1596 states and 2465 transitions. [2025-03-04 00:15:06,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2025-03-04 00:15:06,267 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:15:06,267 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:15:06,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 00:15:06,268 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:15:06,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:15:06,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1397441921, now seen corresponding path program 1 times [2025-03-04 00:15:06,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:15:06,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314152079] [2025-03-04 00:15:06,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:15:06,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:15:06,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 313 statements into 1 equivalence classes. [2025-03-04 00:15:06,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 313 of 313 statements. [2025-03-04 00:15:06,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:15:06,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:15:06,905 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2025-03-04 00:15:06,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:15:06,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314152079] [2025-03-04 00:15:06,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314152079] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:15:06,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:15:06,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 00:15:06,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572535121] [2025-03-04 00:15:06,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:15:06,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 00:15:06,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:15:06,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 00:15:06,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:15:06,907 INFO L87 Difference]: Start difference. First operand 1596 states and 2465 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-03-04 00:15:07,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:15:07,664 INFO L93 Difference]: Finished difference Result 5782 states and 8928 transitions. [2025-03-04 00:15:07,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 00:15:07,666 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) Word has length 313 [2025-03-04 00:15:07,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:15:07,700 INFO L225 Difference]: With dead ends: 5782 [2025-03-04 00:15:07,700 INFO L226 Difference]: Without dead ends: 4282 [2025-03-04 00:15:07,708 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 00:15:07,709 INFO L435 NwaCegarLoop]: 289 mSDtfsCounter, 670 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 670 SdHoareTripleChecker+Valid, 888 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 00:15:07,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [670 Valid, 888 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 00:15:07,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4282 states. [2025-03-04 00:15:07,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4282 to 4278. [2025-03-04 00:15:07,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4278 states, 3151 states have (on average 1.3830529990479212) internal successors, (4358), 3160 states have internal predecessors, (4358), 1089 states have call successors, (1089), 37 states have call predecessors, (1089), 37 states have return successors, (1089), 1080 states have call predecessors, (1089), 1089 states have call successors, (1089) [2025-03-04 00:15:08,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4278 states to 4278 states and 6536 transitions. [2025-03-04 00:15:08,012 INFO L78 Accepts]: Start accepts. Automaton has 4278 states and 6536 transitions. Word has length 313 [2025-03-04 00:15:08,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:15:08,012 INFO L471 AbstractCegarLoop]: Abstraction has 4278 states and 6536 transitions. [2025-03-04 00:15:08,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-03-04 00:15:08,013 INFO L276 IsEmpty]: Start isEmpty. Operand 4278 states and 6536 transitions. [2025-03-04 00:15:08,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2025-03-04 00:15:08,019 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:15:08,019 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:15:08,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 00:15:08,019 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:15:08,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:15:08,019 INFO L85 PathProgramCache]: Analyzing trace with hash 64138078, now seen corresponding path program 1 times [2025-03-04 00:15:08,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:15:08,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697866513] [2025-03-04 00:15:08,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:15:08,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:15:08,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 313 statements into 1 equivalence classes. [2025-03-04 00:15:08,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 313 of 313 statements. [2025-03-04 00:15:08,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:15:08,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:15:08,137 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2025-03-04 00:15:08,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:15:08,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697866513] [2025-03-04 00:15:08,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697866513] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:15:08,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:15:08,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:15:08,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275945275] [2025-03-04 00:15:08,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:15:08,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:15:08,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:15:08,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:15:08,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:15:08,139 INFO L87 Difference]: Start difference. First operand 4278 states and 6536 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, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-03-04 00:15:08,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:15:08,477 INFO L93 Difference]: Finished difference Result 10227 states and 15652 transitions. [2025-03-04 00:15:08,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:15:08,478 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, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) Word has length 313 [2025-03-04 00:15:08,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:15:08,514 INFO L225 Difference]: With dead ends: 10227 [2025-03-04 00:15:08,515 INFO L226 Difference]: Without dead ends: 6232 [2025-03-04 00:15:08,526 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:08,528 INFO L435 NwaCegarLoop]: 547 mSDtfsCounter, 261 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 818 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:15:08,529 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 818 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:15:08,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6232 states. [2025-03-04 00:15:08,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6232 to 6230. [2025-03-04 00:15:08,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6230 states, 4665 states have (on average 1.3839228295819936) internal successors, (6456), 4680 states have internal predecessors, (6456), 1515 states have call successors, (1515), 49 states have call predecessors, (1515), 49 states have return successors, (1515), 1500 states have call predecessors, (1515), 1515 states have call successors, (1515) [2025-03-04 00:15:08,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6230 states to 6230 states and 9486 transitions. [2025-03-04 00:15:08,890 INFO L78 Accepts]: Start accepts. Automaton has 6230 states and 9486 transitions. Word has length 313 [2025-03-04 00:15:08,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:15:08,891 INFO L471 AbstractCegarLoop]: Abstraction has 6230 states and 9486 transitions. [2025-03-04 00:15:08,891 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, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-03-04 00:15:08,891 INFO L276 IsEmpty]: Start isEmpty. Operand 6230 states and 9486 transitions. [2025-03-04 00:15:08,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2025-03-04 00:15:08,896 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:15:08,897 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:15:08,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 00:15:08,897 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:15:08,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:15:08,897 INFO L85 PathProgramCache]: Analyzing trace with hash -320169509, now seen corresponding path program 1 times [2025-03-04 00:15:08,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:15:08,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708069866] [2025-03-04 00:15:08,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:15:08,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:15:08,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 313 statements into 1 equivalence classes. [2025-03-04 00:15:09,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 313 of 313 statements. [2025-03-04 00:15:09,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:15:09,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:15:09,519 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2025-03-04 00:15:09,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:15:09,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708069866] [2025-03-04 00:15:09,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708069866] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:15:09,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:15:09,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 00:15:09,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462151634] [2025-03-04 00:15:09,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:15:09,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 00:15:09,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:15:09,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 00:15:09,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:15:09,521 INFO L87 Difference]: Start difference. First operand 6230 states and 9486 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-03-04 00:15:10,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:15:10,480 INFO L93 Difference]: Finished difference Result 13431 states and 20495 transitions. [2025-03-04 00:15:10,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 00:15:10,481 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) Word has length 313 [2025-03-04 00:15:10,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:15:10,538 INFO L225 Difference]: With dead ends: 13431 [2025-03-04 00:15:10,540 INFO L226 Difference]: Without dead ends: 7962 [2025-03-04 00:15:10,559 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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:10,560 INFO L435 NwaCegarLoop]: 539 mSDtfsCounter, 715 mSDsluCounter, 1122 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 715 SdHoareTripleChecker+Valid, 1661 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 00:15:10,560 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [715 Valid, 1661 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 383 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 00:15:10,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7962 states. [2025-03-04 00:15:10,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7962 to 6179. [2025-03-04 00:15:10,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6179 states, 4614 states have (on average 1.3803641092327699) internal successors, (6369), 4629 states have internal predecessors, (6369), 1515 states have call successors, (1515), 49 states have call predecessors, (1515), 49 states have return successors, (1515), 1500 states have call predecessors, (1515), 1515 states have call successors, (1515) [2025-03-04 00:15:10,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6179 states to 6179 states and 9399 transitions. [2025-03-04 00:15:10,905 INFO L78 Accepts]: Start accepts. Automaton has 6179 states and 9399 transitions. Word has length 313 [2025-03-04 00:15:10,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:15:10,906 INFO L471 AbstractCegarLoop]: Abstraction has 6179 states and 9399 transitions. [2025-03-04 00:15:10,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-03-04 00:15:10,907 INFO L276 IsEmpty]: Start isEmpty. Operand 6179 states and 9399 transitions. [2025-03-04 00:15:10,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2025-03-04 00:15:10,912 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:15:10,913 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:15:10,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 00:15:10,914 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:15:10,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:15:10,915 INFO L85 PathProgramCache]: Analyzing trace with hash -121002247, now seen corresponding path program 1 times [2025-03-04 00:15:10,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:15:10,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179061245] [2025-03-04 00:15:10,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:15:10,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:15:10,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 314 statements into 1 equivalence classes. [2025-03-04 00:15:11,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 314 of 314 statements. [2025-03-04 00:15:11,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:15:11,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:15:12,176 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 54 proven. 78 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2025-03-04 00:15:12,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:15:12,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179061245] [2025-03-04 00:15:12,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179061245] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:15:12,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1538575143] [2025-03-04 00:15:12,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:15:12,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:15:12,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:15:12,179 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:12,183 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:12,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 314 statements into 1 equivalence classes. [2025-03-04 00:15:12,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 314 of 314 statements. [2025-03-04 00:15:12,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:15:12,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:15:12,387 INFO L256 TraceCheckSpWp]: Trace formula consists of 727 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 00:15:12,394 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:15:13,131 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 1968 proven. 54 refuted. 0 times theorem prover too weak. 1938 trivial. 0 not checked. [2025-03-04 00:15:13,131 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:15:13,615 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 78 proven. 54 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2025-03-04 00:15:13,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1538575143] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:15:13,616 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:15:13,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 20 [2025-03-04 00:15:13,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827597932] [2025-03-04 00:15:13,616 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:15:13,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 00:15:13,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:15:13,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 00:15:13,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2025-03-04 00:15:13,618 INFO L87 Difference]: Start difference. First operand 6179 states and 9399 transitions. Second operand has 20 states, 20 states have (on average 10.45) internal successors, (209), 20 states have internal predecessors, (209), 6 states have call successors, (135), 3 states have call predecessors, (135), 6 states have return successors, (135), 6 states have call predecessors, (135), 6 states have call successors, (135) [2025-03-04 00:15:16,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:15:16,952 INFO L93 Difference]: Finished difference Result 15254 states and 22825 transitions. [2025-03-04 00:15:16,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-03-04 00:15:16,953 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 10.45) internal successors, (209), 20 states have internal predecessors, (209), 6 states have call successors, (135), 3 states have call predecessors, (135), 6 states have return successors, (135), 6 states have call predecessors, (135), 6 states have call successors, (135) Word has length 314 [2025-03-04 00:15:16,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:15:16,989 INFO L225 Difference]: With dead ends: 15254 [2025-03-04 00:15:16,989 INFO L226 Difference]: Without dead ends: 9204 [2025-03-04 00:15:17,007 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 678 GetRequests, 619 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 911 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=789, Invalid=2751, Unknown=0, NotChecked=0, Total=3540 [2025-03-04 00:15:17,008 INFO L435 NwaCegarLoop]: 338 mSDtfsCounter, 3506 mSDsluCounter, 2714 mSDsCounter, 0 mSdLazyCounter, 2354 mSolverCounterSat, 1116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3507 SdHoareTripleChecker+Valid, 3052 SdHoareTripleChecker+Invalid, 3470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1116 IncrementalHoareTripleChecker+Valid, 2354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:15:17,008 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3507 Valid, 3052 Invalid, 3470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1116 Valid, 2354 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-04 00:15:17,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9204 states. [2025-03-04 00:15:17,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9204 to 3507. [2025-03-04 00:15:17,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3507 states, 2710 states have (on average 1.3804428044280443) internal successors, (3741), 2728 states have internal predecessors, (3741), 756 states have call successors, (756), 40 states have call predecessors, (756), 40 states have return successors, (756), 738 states have call predecessors, (756), 756 states have call successors, (756) [2025-03-04 00:15:17,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3507 states to 3507 states and 5253 transitions. [2025-03-04 00:15:17,282 INFO L78 Accepts]: Start accepts. Automaton has 3507 states and 5253 transitions. Word has length 314 [2025-03-04 00:15:17,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:15:17,283 INFO L471 AbstractCegarLoop]: Abstraction has 3507 states and 5253 transitions. [2025-03-04 00:15:17,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 10.45) internal successors, (209), 20 states have internal predecessors, (209), 6 states have call successors, (135), 3 states have call predecessors, (135), 6 states have return successors, (135), 6 states have call predecessors, (135), 6 states have call successors, (135) [2025-03-04 00:15:17,283 INFO L276 IsEmpty]: Start isEmpty. Operand 3507 states and 5253 transitions. [2025-03-04 00:15:17,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2025-03-04 00:15:17,288 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:15:17,289 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:15:17,296 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 00:15:17,489 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,SelfDestructingSolverStorable10 [2025-03-04 00:15:17,490 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:15:17,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:15:17,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1894650368, now seen corresponding path program 1 times [2025-03-04 00:15:17,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:15:17,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500061293] [2025-03-04 00:15:17,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:15:17,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:15:17,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 316 statements into 1 equivalence classes. [2025-03-04 00:15:17,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 316 of 316 statements. [2025-03-04 00:15:17,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:15:17,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:15:17,908 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2025-03-04 00:15:17,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:15:17,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500061293] [2025-03-04 00:15:17,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500061293] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:15:17,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:15:17,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 00:15:17,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432041218] [2025-03-04 00:15:17,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:15:17,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 00:15:17,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:15:17,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 00:15:17,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:15:17,913 INFO L87 Difference]: Start difference. First operand 3507 states and 5253 transitions. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-03-04 00:15:18,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:15:18,342 INFO L93 Difference]: Finished difference Result 6017 states and 8996 transitions. [2025-03-04 00:15:18,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 00:15:18,343 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) Word has length 316 [2025-03-04 00:15:18,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:15:18,358 INFO L225 Difference]: With dead ends: 6017 [2025-03-04 00:15:18,358 INFO L226 Difference]: Without dead ends: 3972 [2025-03-04 00:15:18,364 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-04 00:15:18,366 INFO L435 NwaCegarLoop]: 528 mSDtfsCounter, 301 mSDsluCounter, 765 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 1293 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:15:18,366 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 1293 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 00:15:18,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3972 states. [2025-03-04 00:15:18,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3972 to 3519. [2025-03-04 00:15:18,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3519 states, 2722 states have (on average 1.3776634827332843) internal successors, (3750), 2740 states have internal predecessors, (3750), 756 states have call successors, (756), 40 states have call predecessors, (756), 40 states have return successors, (756), 738 states have call predecessors, (756), 756 states have call successors, (756) [2025-03-04 00:15:18,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3519 states to 3519 states and 5262 transitions. [2025-03-04 00:15:18,556 INFO L78 Accepts]: Start accepts. Automaton has 3519 states and 5262 transitions. Word has length 316 [2025-03-04 00:15:18,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:15:18,558 INFO L471 AbstractCegarLoop]: Abstraction has 3519 states and 5262 transitions. [2025-03-04 00:15:18,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-03-04 00:15:18,558 INFO L276 IsEmpty]: Start isEmpty. Operand 3519 states and 5262 transitions. [2025-03-04 00:15:18,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2025-03-04 00:15:18,561 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:15:18,561 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:15:18,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 00:15:18,561 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:15:18,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:15:18,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1040918843, now seen corresponding path program 1 times [2025-03-04 00:15:18,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:15:18,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307147673] [2025-03-04 00:15:18,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:15:18,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:15:18,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 316 statements into 1 equivalence classes. [2025-03-04 00:15:18,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 316 of 316 statements. [2025-03-04 00:15:18,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:15:18,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:15:19,252 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2025-03-04 00:15:19,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:15:19,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307147673] [2025-03-04 00:15:19,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307147673] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:15:19,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:15:19,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 00:15:19,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100710625] [2025-03-04 00:15:19,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:15:19,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 00:15:19,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:15:19,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 00:15:19,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-04 00:15:19,253 INFO L87 Difference]: Start difference. First operand 3519 states and 5262 transitions. Second operand has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-03-04 00:15:20,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:15:20,379 INFO L93 Difference]: Finished difference Result 10931 states and 16221 transitions. [2025-03-04 00:15:20,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 00:15:20,399 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) Word has length 316 [2025-03-04 00:15:20,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:15:20,431 INFO L225 Difference]: With dead ends: 10931 [2025-03-04 00:15:20,431 INFO L226 Difference]: Without dead ends: 8334 [2025-03-04 00:15:20,441 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2025-03-04 00:15:20,442 INFO L435 NwaCegarLoop]: 507 mSDtfsCounter, 489 mSDsluCounter, 1142 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 1649 SdHoareTripleChecker+Invalid, 624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-04 00:15:20,443 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [489 Valid, 1649 Invalid, 624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-04 00:15:20,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8334 states. [2025-03-04 00:15:20,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8334 to 5193. [2025-03-04 00:15:20,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5193 states, 3992 states have (on average 1.371743486973948) internal successors, (5476), 4020 states have internal predecessors, (5476), 1142 states have call successors, (1142), 58 states have call predecessors, (1142), 58 states have return successors, (1142), 1114 states have call predecessors, (1142), 1142 states have call successors, (1142) [2025-03-04 00:15:20,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5193 states to 5193 states and 7760 transitions. [2025-03-04 00:15:20,753 INFO L78 Accepts]: Start accepts. Automaton has 5193 states and 7760 transitions. Word has length 316 [2025-03-04 00:15:20,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:15:20,754 INFO L471 AbstractCegarLoop]: Abstraction has 5193 states and 7760 transitions. [2025-03-04 00:15:20,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-03-04 00:15:20,754 INFO L276 IsEmpty]: Start isEmpty. Operand 5193 states and 7760 transitions. [2025-03-04 00:15:20,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2025-03-04 00:15:20,758 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:15:20,758 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:15:20,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 00:15:20,758 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:15:20,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:15:20,759 INFO L85 PathProgramCache]: Analyzing trace with hash 2002532860, now seen corresponding path program 1 times [2025-03-04 00:15:20,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:15:20,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637178340] [2025-03-04 00:15:20,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:15:20,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:15:20,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 316 statements into 1 equivalence classes. [2025-03-04 00:15:21,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 316 of 316 statements. [2025-03-04 00:15:21,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:15:21,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:15:21,661 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 78 proven. 54 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2025-03-04 00:15:21,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:15:21,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637178340] [2025-03-04 00:15:21,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637178340] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:15:21,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1202130320] [2025-03-04 00:15:21,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:15:21,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:15:21,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:15:21,664 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:21,666 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:21,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 316 statements into 1 equivalence classes. [2025-03-04 00:15:21,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 316 of 316 statements. [2025-03-04 00:15:21,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:15:21,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:15:21,854 INFO L256 TraceCheckSpWp]: Trace formula consists of 729 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 00:15:21,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:15:22,107 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 1988 proven. 102 refuted. 0 times theorem prover too weak. 1870 trivial. 0 not checked. [2025-03-04 00:15:22,109 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:15:22,383 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 78 proven. 54 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2025-03-04 00:15:22,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1202130320] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:15:22,383 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:15:22,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 7] total 16 [2025-03-04 00:15:22,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463933413] [2025-03-04 00:15:22,384 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:15:22,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 00:15:22,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:15:22,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 00:15:22,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2025-03-04 00:15:22,387 INFO L87 Difference]: Start difference. First operand 5193 states and 7760 transitions. Second operand has 16 states, 16 states have (on average 10.125) internal successors, (162), 16 states have internal predecessors, (162), 3 states have call successors, (63), 3 states have call predecessors, (63), 5 states have return successors, (64), 3 states have call predecessors, (64), 3 states have call successors, (64) [2025-03-04 00:15:24,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:15:24,460 INFO L93 Difference]: Finished difference Result 13689 states and 20249 transitions. [2025-03-04 00:15:24,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-03-04 00:15:24,460 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 10.125) internal successors, (162), 16 states have internal predecessors, (162), 3 states have call successors, (63), 3 states have call predecessors, (63), 5 states have return successors, (64), 3 states have call predecessors, (64), 3 states have call successors, (64) Word has length 316 [2025-03-04 00:15:24,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:15:24,502 INFO L225 Difference]: With dead ends: 13689 [2025-03-04 00:15:24,502 INFO L226 Difference]: Without dead ends: 10316 [2025-03-04 00:15:24,515 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 671 GetRequests, 627 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 478 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=456, Invalid=1436, Unknown=0, NotChecked=0, Total=1892 [2025-03-04 00:15:24,516 INFO L435 NwaCegarLoop]: 377 mSDtfsCounter, 1019 mSDsluCounter, 2656 mSDsCounter, 0 mSdLazyCounter, 1890 mSolverCounterSat, 260 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1073 SdHoareTripleChecker+Valid, 3033 SdHoareTripleChecker+Invalid, 2150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 260 IncrementalHoareTripleChecker+Valid, 1890 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:15:24,516 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1073 Valid, 3033 Invalid, 2150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [260 Valid, 1890 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-04 00:15:24,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10316 states. [2025-03-04 00:15:24,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10316 to 5752. [2025-03-04 00:15:24,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5752 states, 4337 states have (on average 1.3520866958727231) internal successors, (5864), 4371 states have internal predecessors, (5864), 1328 states have call successors, (1328), 86 states have call predecessors, (1328), 86 states have return successors, (1328), 1294 states have call predecessors, (1328), 1328 states have call successors, (1328) [2025-03-04 00:15:24,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5752 states to 5752 states and 8520 transitions. [2025-03-04 00:15:24,958 INFO L78 Accepts]: Start accepts. Automaton has 5752 states and 8520 transitions. Word has length 316 [2025-03-04 00:15:24,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:15:24,959 INFO L471 AbstractCegarLoop]: Abstraction has 5752 states and 8520 transitions. [2025-03-04 00:15:24,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 10.125) internal successors, (162), 16 states have internal predecessors, (162), 3 states have call successors, (63), 3 states have call predecessors, (63), 5 states have return successors, (64), 3 states have call predecessors, (64), 3 states have call successors, (64) [2025-03-04 00:15:24,959 INFO L276 IsEmpty]: Start isEmpty. Operand 5752 states and 8520 transitions. [2025-03-04 00:15:24,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2025-03-04 00:15:24,963 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:15:24,963 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:15:24,972 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:25,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:15:25,182 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:15:25,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:15:25,183 INFO L85 PathProgramCache]: Analyzing trace with hash 705414949, now seen corresponding path program 1 times [2025-03-04 00:15:25,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:15:25,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004633638] [2025-03-04 00:15:25,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:15:25,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:15:25,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 316 statements into 1 equivalence classes. [2025-03-04 00:15:25,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 316 of 316 statements. [2025-03-04 00:15:25,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:15:25,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:15:25,676 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2025-03-04 00:15:25,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:15:25,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004633638] [2025-03-04 00:15:25,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004633638] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:15:25,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:15:25,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:15:25,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528772373] [2025-03-04 00:15:25,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:15:25,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:15:25,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:15:25,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:15:25,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:15:25,679 INFO L87 Difference]: Start difference. First operand 5752 states and 8520 transitions. Second operand has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-03-04 00:15:26,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:15:26,281 INFO L93 Difference]: Finished difference Result 11704 states and 17340 transitions. [2025-03-04 00:15:26,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:15:26,282 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) Word has length 316 [2025-03-04 00:15:26,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:15:26,326 INFO L225 Difference]: With dead ends: 11704 [2025-03-04 00:15:26,326 INFO L226 Difference]: Without dead ends: 8216 [2025-03-04 00:15:26,338 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 1 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:26,339 INFO L435 NwaCegarLoop]: 378 mSDtfsCounter, 444 mSDsluCounter, 674 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 444 SdHoareTripleChecker+Valid, 1052 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:15:26,340 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [444 Valid, 1052 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 00:15:26,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8216 states. [2025-03-04 00:15:26,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8216 to 7435. [2025-03-04 00:15:26,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7435 states, 5566 states have (on average 1.3458498023715415) internal successors, (7491), 5610 states have internal predecessors, (7491), 1752 states have call successors, (1752), 116 states have call predecessors, (1752), 116 states have return successors, (1752), 1708 states have call predecessors, (1752), 1752 states have call successors, (1752) [2025-03-04 00:15:26,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7435 states to 7435 states and 10995 transitions. [2025-03-04 00:15:26,918 INFO L78 Accepts]: Start accepts. Automaton has 7435 states and 10995 transitions. Word has length 316 [2025-03-04 00:15:26,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:15:26,919 INFO L471 AbstractCegarLoop]: Abstraction has 7435 states and 10995 transitions. [2025-03-04 00:15:26,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-03-04 00:15:26,919 INFO L276 IsEmpty]: Start isEmpty. Operand 7435 states and 10995 transitions. [2025-03-04 00:15:26,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2025-03-04 00:15:26,926 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:15:26,926 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:15:26,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 00:15:26,926 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:15:26,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:15:26,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1710679824, now seen corresponding path program 1 times [2025-03-04 00:15:26,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:15:26,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372759572] [2025-03-04 00:15:26,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:15:26,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:15:26,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 317 statements into 1 equivalence classes. [2025-03-04 00:15:26,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 317 of 317 statements. [2025-03-04 00:15:26,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:15:26,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:15:27,456 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2025-03-04 00:15:27,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:15:27,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372759572] [2025-03-04 00:15:27,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372759572] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:15:27,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:15:27,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:15:27,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644119580] [2025-03-04 00:15:27,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:15:27,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:15:27,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:15:27,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:15:27,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:15:27,458 INFO L87 Difference]: Start difference. First operand 7435 states and 10995 transitions. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-03-04 00:15:28,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:15:28,131 INFO L93 Difference]: Finished difference Result 11576 states and 17192 transitions. [2025-03-04 00:15:28,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:15:28,131 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) Word has length 317 [2025-03-04 00:15:28,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:15:28,152 INFO L225 Difference]: With dead ends: 11576 [2025-03-04 00:15:28,153 INFO L226 Difference]: Without dead ends: 5383 [2025-03-04 00:15:28,163 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:15:28,164 INFO L435 NwaCegarLoop]: 676 mSDtfsCounter, 535 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 535 SdHoareTripleChecker+Valid, 1248 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 00:15:28,164 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [535 Valid, 1248 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 00:15:28,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5383 states. [2025-03-04 00:15:28,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5383 to 5082. [2025-03-04 00:15:28,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5082 states, 3860 states have (on average 1.3575129533678756) internal successors, (5240), 3880 states have internal predecessors, (5240), 1143 states have call successors, (1143), 78 states have call predecessors, (1143), 78 states have return successors, (1143), 1123 states have call predecessors, (1143), 1143 states have call successors, (1143) [2025-03-04 00:15:28,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5082 states to 5082 states and 7526 transitions. [2025-03-04 00:15:28,451 INFO L78 Accepts]: Start accepts. Automaton has 5082 states and 7526 transitions. Word has length 317 [2025-03-04 00:15:28,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:15:28,452 INFO L471 AbstractCegarLoop]: Abstraction has 5082 states and 7526 transitions. [2025-03-04 00:15:28,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-03-04 00:15:28,452 INFO L276 IsEmpty]: Start isEmpty. Operand 5082 states and 7526 transitions. [2025-03-04 00:15:28,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2025-03-04 00:15:28,455 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:15:28,455 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:15:28,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 00:15:28,455 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:15:28,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:15:28,456 INFO L85 PathProgramCache]: Analyzing trace with hash 9939345, now seen corresponding path program 1 times [2025-03-04 00:15:28,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:15:28,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032623858] [2025-03-04 00:15:28,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:15:28,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:15:28,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 317 statements into 1 equivalence classes. [2025-03-04 00:15:28,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 317 of 317 statements. [2025-03-04 00:15:28,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:15:28,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:15:29,335 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2025-03-04 00:15:29,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:15:29,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032623858] [2025-03-04 00:15:29,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032623858] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:15:29,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:15:29,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 00:15:29,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205767480] [2025-03-04 00:15:29,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:15:29,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 00:15:29,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:15:29,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 00:15:29,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 00:15:29,338 INFO L87 Difference]: Start difference. First operand 5082 states and 7526 transitions. Second operand has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-03-04 00:15:30,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:15:30,263 INFO L93 Difference]: Finished difference Result 15240 states and 22474 transitions. [2025-03-04 00:15:30,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 00:15:30,264 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) Word has length 317 [2025-03-04 00:15:30,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:15:30,299 INFO L225 Difference]: With dead ends: 15240 [2025-03-04 00:15:30,299 INFO L226 Difference]: Without dead ends: 10556 [2025-03-04 00:15:30,311 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 00:15:30,312 INFO L435 NwaCegarLoop]: 511 mSDtfsCounter, 821 mSDsluCounter, 763 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 821 SdHoareTripleChecker+Valid, 1274 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 00:15:30,312 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [821 Valid, 1274 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 00:15:30,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10556 states. [2025-03-04 00:15:30,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10556 to 8366. [2025-03-04 00:15:30,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8366 states, 6507 states have (on average 1.3574611956354694) internal successors, (8833), 6553 states have internal predecessors, (8833), 1753 states have call successors, (1753), 105 states have call predecessors, (1753), 105 states have return successors, (1753), 1707 states have call predecessors, (1753), 1753 states have call successors, (1753) [2025-03-04 00:15:30,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8366 states to 8366 states and 12339 transitions. [2025-03-04 00:15:30,796 INFO L78 Accepts]: Start accepts. Automaton has 8366 states and 12339 transitions. Word has length 317 [2025-03-04 00:15:30,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:15:30,796 INFO L471 AbstractCegarLoop]: Abstraction has 8366 states and 12339 transitions. [2025-03-04 00:15:30,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-03-04 00:15:30,797 INFO L276 IsEmpty]: Start isEmpty. Operand 8366 states and 12339 transitions. [2025-03-04 00:15:30,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2025-03-04 00:15:30,800 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:15:30,800 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:15:30,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 00:15:30,801 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:15:30,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:15:30,801 INFO L85 PathProgramCache]: Analyzing trace with hash 104635126, now seen corresponding path program 1 times [2025-03-04 00:15:30,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:15:30,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198191422] [2025-03-04 00:15:30,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:15:30,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:15:30,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 317 statements into 1 equivalence classes. [2025-03-04 00:15:30,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 317 of 317 statements. [2025-03-04 00:15:30,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:15:30,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:15:31,861 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2025-03-04 00:15:31,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:15:31,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198191422] [2025-03-04 00:15:31,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198191422] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:15:31,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:15:31,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 00:15:31,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873694466] [2025-03-04 00:15:31,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:15:31,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 00:15:31,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:15:31,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 00:15:31,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=40, Unknown=0, NotChecked=0, Total=72 [2025-03-04 00:15:31,863 INFO L87 Difference]: Start difference. First operand 8366 states and 12339 transitions. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-03-04 00:15:33,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:15:33,607 INFO L93 Difference]: Finished difference Result 20299 states and 29893 transitions. [2025-03-04 00:15:33,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 00:15:33,608 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) Word has length 317 [2025-03-04 00:15:33,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:15:33,663 INFO L225 Difference]: With dead ends: 20299 [2025-03-04 00:15:33,663 INFO L226 Difference]: Without dead ends: 13667 [2025-03-04 00:15:33,683 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2025-03-04 00:15:33,684 INFO L435 NwaCegarLoop]: 540 mSDtfsCounter, 1113 mSDsluCounter, 931 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 248 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1113 SdHoareTripleChecker+Valid, 1471 SdHoareTripleChecker+Invalid, 851 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 248 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-04 00:15:33,684 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1113 Valid, 1471 Invalid, 851 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [248 Valid, 603 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-04 00:15:33,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13667 states. [2025-03-04 00:15:34,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13667 to 8462. [2025-03-04 00:15:34,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8462 states, 6603 states have (on average 1.3611994547932758) internal successors, (8988), 6649 states have internal predecessors, (8988), 1753 states have call successors, (1753), 105 states have call predecessors, (1753), 105 states have return successors, (1753), 1707 states have call predecessors, (1753), 1753 states have call successors, (1753) [2025-03-04 00:15:34,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8462 states to 8462 states and 12494 transitions. [2025-03-04 00:15:34,451 INFO L78 Accepts]: Start accepts. Automaton has 8462 states and 12494 transitions. Word has length 317 [2025-03-04 00:15:34,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:15:34,452 INFO L471 AbstractCegarLoop]: Abstraction has 8462 states and 12494 transitions. [2025-03-04 00:15:34,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-03-04 00:15:34,452 INFO L276 IsEmpty]: Start isEmpty. Operand 8462 states and 12494 transitions. [2025-03-04 00:15:34,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2025-03-04 00:15:34,456 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:15:34,456 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:15:34,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 00:15:34,457 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:15:34,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:15:34,457 INFO L85 PathProgramCache]: Analyzing trace with hash 135654933, now seen corresponding path program 1 times [2025-03-04 00:15:34,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:15:34,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758003972] [2025-03-04 00:15:34,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:15:34,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:15:34,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 317 statements into 1 equivalence classes. [2025-03-04 00:15:34,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 317 of 317 statements. [2025-03-04 00:15:34,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:15:34,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:15:35,071 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 87 proven. 45 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2025-03-04 00:15:35,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:15:35,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758003972] [2025-03-04 00:15:35,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758003972] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:15:35,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1178998508] [2025-03-04 00:15:35,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:15:35,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:15:35,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:15:35,075 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:35,076 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:35,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 317 statements into 1 equivalence classes. [2025-03-04 00:15:35,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 317 of 317 statements. [2025-03-04 00:15:35,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:15:35,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:15:35,267 INFO L256 TraceCheckSpWp]: Trace formula consists of 727 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-04 00:15:35,272 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:15:36,217 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 1968 proven. 54 refuted. 0 times theorem prover too weak. 1938 trivial. 0 not checked. [2025-03-04 00:15:36,217 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:15:36,872 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 78 proven. 54 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2025-03-04 00:15:36,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1178998508] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:15:36,872 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:15:36,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11, 11] total 24 [2025-03-04 00:15:36,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936676235] [2025-03-04 00:15:36,872 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:15:36,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 00:15:36,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:15:36,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 00:15:36,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=448, Unknown=0, NotChecked=0, Total=552 [2025-03-04 00:15:36,874 INFO L87 Difference]: Start difference. First operand 8462 states and 12494 transitions. Second operand has 24 states, 24 states have (on average 9.791666666666666) internal successors, (235), 24 states have internal predecessors, (235), 5 states have call successors, (108), 3 states have call predecessors, (108), 6 states have return successors, (109), 5 states have call predecessors, (109), 5 states have call successors, (109) [2025-03-04 00:15:39,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:15:39,197 INFO L93 Difference]: Finished difference Result 9436 states and 13885 transitions. [2025-03-04 00:15:39,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-03-04 00:15:39,198 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 9.791666666666666) internal successors, (235), 24 states have internal predecessors, (235), 5 states have call successors, (108), 3 states have call predecessors, (108), 6 states have return successors, (109), 5 states have call predecessors, (109), 5 states have call successors, (109) Word has length 317 [2025-03-04 00:15:39,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:15:39,209 INFO L225 Difference]: With dead ends: 9436 [2025-03-04 00:15:39,209 INFO L226 Difference]: Without dead ends: 1718 [2025-03-04 00:15:39,258 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 687 GetRequests, 623 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1034 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=999, Invalid=3161, Unknown=0, NotChecked=0, Total=4160 [2025-03-04 00:15:39,259 INFO L435 NwaCegarLoop]: 500 mSDtfsCounter, 1868 mSDsluCounter, 2578 mSDsCounter, 0 mSdLazyCounter, 2646 mSolverCounterSat, 812 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1868 SdHoareTripleChecker+Valid, 3078 SdHoareTripleChecker+Invalid, 3458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 812 IncrementalHoareTripleChecker+Valid, 2646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-04 00:15:39,259 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1868 Valid, 3078 Invalid, 3458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [812 Valid, 2646 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-04 00:15:39,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1718 states. [2025-03-04 00:15:39,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1718 to 1371. [2025-03-04 00:15:39,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1371 states, 1095 states have (on average 1.3360730593607306) internal successors, (1463), 1101 states have internal predecessors, (1463), 251 states have call successors, (251), 24 states have call predecessors, (251), 24 states have return successors, (251), 245 states have call predecessors, (251), 251 states have call successors, (251) [2025-03-04 00:15:39,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1371 states to 1371 states and 1965 transitions. [2025-03-04 00:15:39,346 INFO L78 Accepts]: Start accepts. Automaton has 1371 states and 1965 transitions. Word has length 317 [2025-03-04 00:15:39,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:15:39,346 INFO L471 AbstractCegarLoop]: Abstraction has 1371 states and 1965 transitions. [2025-03-04 00:15:39,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 9.791666666666666) internal successors, (235), 24 states have internal predecessors, (235), 5 states have call successors, (108), 3 states have call predecessors, (108), 6 states have return successors, (109), 5 states have call predecessors, (109), 5 states have call successors, (109) [2025-03-04 00:15:39,347 INFO L276 IsEmpty]: Start isEmpty. Operand 1371 states and 1965 transitions. [2025-03-04 00:15:39,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2025-03-04 00:15:39,349 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:15:39,349 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:15:39,356 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:39,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:15:39,549 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:15:39,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:15:39,551 INFO L85 PathProgramCache]: Analyzing trace with hash 1538311988, now seen corresponding path program 1 times [2025-03-04 00:15:39,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:15:39,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643685780] [2025-03-04 00:15:39,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:15:39,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:15:39,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 317 statements into 1 equivalence classes. [2025-03-04 00:15:39,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 317 of 317 statements. [2025-03-04 00:15:39,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:15:39,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 00:15:39,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [524836985] [2025-03-04 00:15:39,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:15:39,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:15:39,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:15:40,001 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:40,002 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:40,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 317 statements into 1 equivalence classes.