./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.5.ufo.BOUNDED-10.pals+Problem12_label08.c --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/combinations/pals_lcr.5.ufo.BOUNDED-10.pals+Problem12_label08.c -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 065db717d2cdf97087f1b115414109818504267e957198e710d38901ef11a98a --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 16:09:37,828 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 16:09:37,889 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 16:09:37,893 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 16:09:37,893 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 16:09:37,911 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 16:09:37,912 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 16:09:37,912 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 16:09:37,912 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 16:09:37,913 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 16:09:37,913 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 16:09:37,913 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 16:09:37,913 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 16:09:37,913 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 16:09:37,913 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 16:09:37,913 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 16:09:37,914 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 16:09:37,914 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 16:09:37,914 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 16:09:37,914 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 16:09:37,914 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 16:09:37,914 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 16:09:37,914 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 16:09:37,914 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 16:09:37,914 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 16:09:37,914 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 16:09:37,914 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 16:09:37,914 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 16:09:37,914 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 16:09:37,914 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 16:09:37,914 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 16:09:37,914 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 16:09:37,914 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 16:09:37,915 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 16:09:37,915 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 16:09:37,915 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 16:09:37,915 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 16:09:37,915 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 16:09:37,915 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 16:09:37,915 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 16:09:37,915 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 16:09:37,915 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 16:09:37,915 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 16:09:37,915 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 -> 065db717d2cdf97087f1b115414109818504267e957198e710d38901ef11a98a [2025-03-03 16:09:38,124 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 16:09:38,130 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 16:09:38,132 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 16:09:38,133 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 16:09:38,133 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 16:09:38,134 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.5.ufo.BOUNDED-10.pals+Problem12_label08.c [2025-03-03 16:09:39,252 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e9a10a68/4469940b283c451abd5fa75555816959/FLAG496c6b497 [2025-03-03 16:09:39,725 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 16:09:39,726 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.5.ufo.BOUNDED-10.pals+Problem12_label08.c [2025-03-03 16:09:39,756 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e9a10a68/4469940b283c451abd5fa75555816959/FLAG496c6b497 [2025-03-03 16:09:39,773 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e9a10a68/4469940b283c451abd5fa75555816959 [2025-03-03 16:09:39,774 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 16:09:39,775 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 16:09:39,776 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 16:09:39,776 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 16:09:39,779 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 16:09:39,779 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 04:09:39" (1/1) ... [2025-03-03 16:09:39,781 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3019269f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:09:39, skipping insertion in model container [2025-03-03 16:09:39,781 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 04:09:39" (1/1) ... [2025-03-03 16:09:39,861 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 16:09:40,147 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/combinations/pals_lcr.5.ufo.BOUNDED-10.pals+Problem12_label08.c[11640,11653] [2025-03-03 16:09:40,184 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/combinations/pals_lcr.5.ufo.BOUNDED-10.pals+Problem12_label08.c[15147,15160] [2025-03-03 16:09:40,625 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 16:09:40,634 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 16:09:40,669 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/combinations/pals_lcr.5.ufo.BOUNDED-10.pals+Problem12_label08.c[11640,11653] [2025-03-03 16:09:40,676 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/combinations/pals_lcr.5.ufo.BOUNDED-10.pals+Problem12_label08.c[15147,15160] [2025-03-03 16:09:40,959 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 16:09:40,980 INFO L204 MainTranslator]: Completed translation [2025-03-03 16:09:40,980 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:09:40 WrapperNode [2025-03-03 16:09:40,981 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 16:09:40,982 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 16:09:40,982 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 16:09:40,982 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 16:09:40,986 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:09:40" (1/1) ... [2025-03-03 16:09:41,020 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:09:40" (1/1) ... [2025-03-03 16:09:41,232 INFO L138 Inliner]: procedures = 36, calls = 22, calls flagged for inlining = 17, calls inlined = 17, statements flattened = 5093 [2025-03-03 16:09:41,234 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 16:09:41,234 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 16:09:41,234 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 16:09:41,235 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 16:09:41,240 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:09:40" (1/1) ... [2025-03-03 16:09:41,241 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:09:40" (1/1) ... [2025-03-03 16:09:41,282 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:09:40" (1/1) ... [2025-03-03 16:09:41,402 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 16:09:41,403 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:09:40" (1/1) ... [2025-03-03 16:09:41,403 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:09:40" (1/1) ... [2025-03-03 16:09:41,491 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:09:40" (1/1) ... [2025-03-03 16:09:41,503 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:09:40" (1/1) ... [2025-03-03 16:09:41,517 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:09:40" (1/1) ... [2025-03-03 16:09:41,532 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:09:40" (1/1) ... [2025-03-03 16:09:41,567 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 16:09:41,569 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 16:09:41,569 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 16:09:41,569 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 16:09:41,570 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:09:40" (1/1) ... [2025-03-03 16:09:41,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 16:09:41,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:09:41,593 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 16:09:41,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 16:09:41,617 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 16:09:41,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 16:09:41,618 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 16:09:41,618 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 16:09:41,770 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 16:09:41,771 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 16:09:44,863 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2127: havoc calculate_output_#t~ret38#1; [2025-03-03 16:09:44,863 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3606: havoc calculate_output2_#t~ret39#1; [2025-03-03 16:09:44,863 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5096: havoc calculate_output3_#t~ret40#1; [2025-03-03 16:09:44,997 INFO L? ?]: Removed 744 outVars from TransFormulas that were not future-live. [2025-03-03 16:09:44,997 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 16:09:45,026 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 16:09:45,026 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 16:09:45,026 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 04:09:45 BoogieIcfgContainer [2025-03-03 16:09:45,026 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 16:09:45,028 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 16:09:45,028 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 16:09:45,033 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 16:09:45,034 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 04:09:39" (1/3) ... [2025-03-03 16:09:45,034 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48a6a663 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 04:09:45, skipping insertion in model container [2025-03-03 16:09:45,034 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:09:40" (2/3) ... [2025-03-03 16:09:45,034 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48a6a663 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 04:09:45, skipping insertion in model container [2025-03-03 16:09:45,034 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 04:09:45" (3/3) ... [2025-03-03 16:09:45,035 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.ufo.BOUNDED-10.pals+Problem12_label08.c [2025-03-03 16:09:45,047 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 16:09:45,050 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.5.ufo.BOUNDED-10.pals+Problem12_label08.c that has 1 procedures, 898 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-03-03 16:09:45,115 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 16:09:45,122 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;@46d5e8df, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 16:09:45,123 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-03 16:09:45,128 INFO L276 IsEmpty]: Start isEmpty. Operand has 898 states, 895 states have (on average 1.9039106145251397) internal successors, (1704), 897 states have internal predecessors, (1704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:09:45,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-03 16:09:45,132 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:09:45,132 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:09:45,133 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:09:45,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:09:45,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1170366575, now seen corresponding path program 1 times [2025-03-03 16:09:45,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:09:45,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883989280] [2025-03-03 16:09:45,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:09:45,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:09:45,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-03 16:09:45,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-03 16:09:45,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:09:45,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:09:45,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:09:45,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:09:45,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883989280] [2025-03-03 16:09:45,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883989280] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:09:45,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:09:45,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 16:09:45,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419616994] [2025-03-03 16:09:45,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:09:45,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 16:09:45,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:09:45,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 16:09:45,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 16:09:45,342 INFO L87 Difference]: Start difference. First operand has 898 states, 895 states have (on average 1.9039106145251397) internal successors, (1704), 897 states have internal predecessors, (1704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:09:45,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:09:45,413 INFO L93 Difference]: Finished difference Result 1759 states and 3338 transitions. [2025-03-03 16:09:45,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 16:09:45,414 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-03-03 16:09:45,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:09:45,424 INFO L225 Difference]: With dead ends: 1759 [2025-03-03 16:09:45,424 INFO L226 Difference]: Without dead ends: 833 [2025-03-03 16:09:45,428 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 16:09:45,430 INFO L435 NwaCegarLoop]: 1640 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1640 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:09:45,431 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1640 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:09:45,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 833 states. [2025-03-03 16:09:45,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 833 to 833. [2025-03-03 16:09:45,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 833 states, 831 states have (on average 1.8941034897713598) internal successors, (1574), 832 states have internal predecessors, (1574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:09:45,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 833 states and 1574 transitions. [2025-03-03 16:09:45,499 INFO L78 Accepts]: Start accepts. Automaton has 833 states and 1574 transitions. Word has length 24 [2025-03-03 16:09:45,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:09:45,499 INFO L471 AbstractCegarLoop]: Abstraction has 833 states and 1574 transitions. [2025-03-03 16:09:45,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:09:45,500 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 1574 transitions. [2025-03-03 16:09:45,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-03 16:09:45,500 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:09:45,500 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:09:45,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 16:09:45,501 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:09:45,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:09:45,501 INFO L85 PathProgramCache]: Analyzing trace with hash 2127528368, now seen corresponding path program 1 times [2025-03-03 16:09:45,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:09:45,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125548879] [2025-03-03 16:09:45,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:09:45,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:09:45,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-03 16:09:45,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-03 16:09:45,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:09:45,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:09:45,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:09:45,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:09:45,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125548879] [2025-03-03 16:09:45,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125548879] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:09:45,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:09:45,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:09:45,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213886821] [2025-03-03 16:09:45,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:09:45,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:09:45,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:09:45,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:09:45,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:09:45,709 INFO L87 Difference]: Start difference. First operand 833 states and 1574 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:09:45,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:09:45,807 INFO L93 Difference]: Finished difference Result 879 states and 1645 transitions. [2025-03-03 16:09:45,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 16:09:45,808 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-03-03 16:09:45,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:09:45,811 INFO L225 Difference]: With dead ends: 879 [2025-03-03 16:09:45,811 INFO L226 Difference]: Without dead ends: 833 [2025-03-03 16:09:45,812 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:09:45,812 INFO L435 NwaCegarLoop]: 1572 mSDtfsCounter, 0 mSDsluCounter, 4680 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6252 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:09:45,812 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6252 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:09:45,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 833 states. [2025-03-03 16:09:45,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 833 to 833. [2025-03-03 16:09:45,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 833 states, 831 states have (on average 1.8567990373044525) internal successors, (1543), 832 states have internal predecessors, (1543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:09:45,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 833 states and 1543 transitions. [2025-03-03 16:09:45,829 INFO L78 Accepts]: Start accepts. Automaton has 833 states and 1543 transitions. Word has length 24 [2025-03-03 16:09:45,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:09:45,829 INFO L471 AbstractCegarLoop]: Abstraction has 833 states and 1543 transitions. [2025-03-03 16:09:45,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:09:45,830 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 1543 transitions. [2025-03-03 16:09:45,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-03 16:09:45,830 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:09:45,830 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:09:45,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 16:09:45,831 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:09:45,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:09:45,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1670637321, now seen corresponding path program 1 times [2025-03-03 16:09:45,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:09:45,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742265703] [2025-03-03 16:09:45,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:09:45,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:09:45,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-03 16:09:45,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-03 16:09:45,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:09:45,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:09:45,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:09:45,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:09:45,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742265703] [2025-03-03 16:09:45,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742265703] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:09:45,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:09:45,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 16:09:45,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406311800] [2025-03-03 16:09:45,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:09:45,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:09:45,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:09:45,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:09:45,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:09:45,896 INFO L87 Difference]: Start difference. First operand 833 states and 1543 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:09:48,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:09:48,375 INFO L93 Difference]: Finished difference Result 2337 states and 4416 transitions. [2025-03-03 16:09:48,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:09:48,376 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-03-03 16:09:48,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:09:48,382 INFO L225 Difference]: With dead ends: 2337 [2025-03-03 16:09:48,382 INFO L226 Difference]: Without dead ends: 1584 [2025-03-03 16:09:48,383 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:09:48,383 INFO L435 NwaCegarLoop]: 525 mSDtfsCounter, 892 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2274 mSolverCounterSat, 591 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 892 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 2865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 591 IncrementalHoareTripleChecker+Valid, 2274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-03 16:09:48,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [892 Valid, 532 Invalid, 2865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [591 Valid, 2274 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-03 16:09:48,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1584 states. [2025-03-03 16:09:48,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1584 to 1584. [2025-03-03 16:09:48,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1584 states, 1582 states have (on average 1.6245259165613148) internal successors, (2570), 1583 states have internal predecessors, (2570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:09:48,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1584 states to 1584 states and 2570 transitions. [2025-03-03 16:09:48,406 INFO L78 Accepts]: Start accepts. Automaton has 1584 states and 2570 transitions. Word has length 30 [2025-03-03 16:09:48,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:09:48,407 INFO L471 AbstractCegarLoop]: Abstraction has 1584 states and 2570 transitions. [2025-03-03 16:09:48,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:09:48,407 INFO L276 IsEmpty]: Start isEmpty. Operand 1584 states and 2570 transitions. [2025-03-03 16:09:48,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-03 16:09:48,408 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:09:48,408 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:09:48,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 16:09:48,408 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:09:48,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:09:48,409 INFO L85 PathProgramCache]: Analyzing trace with hash -130168238, now seen corresponding path program 1 times [2025-03-03 16:09:48,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:09:48,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667096200] [2025-03-03 16:09:48,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:09:48,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:09:48,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-03 16:09:48,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-03 16:09:48,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:09:48,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:09:48,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:09:48,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:09:48,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667096200] [2025-03-03 16:09:48,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667096200] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:09:48,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:09:48,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 16:09:48,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349224020] [2025-03-03 16:09:48,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:09:48,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 16:09:48,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:09:48,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 16:09:48,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 16:09:48,547 INFO L87 Difference]: Start difference. First operand 1584 states and 2570 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:09:48,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:09:48,719 INFO L93 Difference]: Finished difference Result 2004 states and 3240 transitions. [2025-03-03 16:09:48,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 16:09:48,720 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-03-03 16:09:48,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:09:48,725 INFO L225 Difference]: With dead ends: 2004 [2025-03-03 16:09:48,726 INFO L226 Difference]: Without dead ends: 1962 [2025-03-03 16:09:48,726 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2025-03-03 16:09:48,727 INFO L435 NwaCegarLoop]: 1539 mSDtfsCounter, 7898 mSDsluCounter, 1460 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7898 SdHoareTripleChecker+Valid, 2999 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:09:48,727 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7898 Valid, 2999 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:09:48,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2025-03-03 16:09:48,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1624. [2025-03-03 16:09:48,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1624 states, 1622 states have (on average 1.623921085080148) internal successors, (2634), 1623 states have internal predecessors, (2634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:09:48,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1624 states to 1624 states and 2634 transitions. [2025-03-03 16:09:48,753 INFO L78 Accepts]: Start accepts. Automaton has 1624 states and 2634 transitions. Word has length 54 [2025-03-03 16:09:48,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:09:48,753 INFO L471 AbstractCegarLoop]: Abstraction has 1624 states and 2634 transitions. [2025-03-03 16:09:48,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:09:48,753 INFO L276 IsEmpty]: Start isEmpty. Operand 1624 states and 2634 transitions. [2025-03-03 16:09:48,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-03 16:09:48,754 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:09:48,754 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:09:48,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 16:09:48,754 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:09:48,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:09:48,755 INFO L85 PathProgramCache]: Analyzing trace with hash 582728109, now seen corresponding path program 1 times [2025-03-03 16:09:48,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:09:48,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865170345] [2025-03-03 16:09:48,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:09:48,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:09:48,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-03 16:09:48,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-03 16:09:48,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:09:48,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:09:48,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:09:48,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:09:48,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865170345] [2025-03-03 16:09:48,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865170345] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:09:48,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:09:48,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:09:48,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845479792] [2025-03-03 16:09:48,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:09:48,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:09:48,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:09:48,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:09:48,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:09:48,830 INFO L87 Difference]: Start difference. First operand 1624 states and 2634 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:09:48,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:09:48,853 INFO L93 Difference]: Finished difference Result 1777 states and 2877 transitions. [2025-03-03 16:09:48,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:09:48,853 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2025-03-03 16:09:48,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:09:48,859 INFO L225 Difference]: With dead ends: 1777 [2025-03-03 16:09:48,859 INFO L226 Difference]: Without dead ends: 1695 [2025-03-03 16:09:48,860 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:09:48,860 INFO L435 NwaCegarLoop]: 1541 mSDtfsCounter, 1482 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1482 SdHoareTripleChecker+Valid, 1603 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:09:48,861 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1482 Valid, 1603 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:09:48,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1695 states. [2025-03-03 16:09:48,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1695 to 1693. [2025-03-03 16:09:48,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1693 states, 1691 states have (on average 1.621525724423418) internal successors, (2742), 1692 states have internal predecessors, (2742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:09:48,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1693 states to 1693 states and 2742 transitions. [2025-03-03 16:09:48,887 INFO L78 Accepts]: Start accepts. Automaton has 1693 states and 2742 transitions. Word has length 56 [2025-03-03 16:09:48,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:09:48,888 INFO L471 AbstractCegarLoop]: Abstraction has 1693 states and 2742 transitions. [2025-03-03 16:09:48,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:09:48,888 INFO L276 IsEmpty]: Start isEmpty. Operand 1693 states and 2742 transitions. [2025-03-03 16:09:48,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-03 16:09:48,889 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:09:48,889 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:09:48,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 16:09:48,889 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:09:48,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:09:48,890 INFO L85 PathProgramCache]: Analyzing trace with hash 615051344, now seen corresponding path program 1 times [2025-03-03 16:09:48,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:09:48,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566338469] [2025-03-03 16:09:48,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:09:48,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:09:48,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-03 16:09:48,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-03 16:09:48,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:09:48,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:09:49,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:09:49,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:09:49,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566338469] [2025-03-03 16:09:49,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566338469] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:09:49,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:09:49,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 16:09:49,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758670271] [2025-03-03 16:09:49,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:09:49,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 16:09:49,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:09:49,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 16:09:49,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 16:09:49,089 INFO L87 Difference]: Start difference. First operand 1693 states and 2742 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:09:49,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:09:49,215 INFO L93 Difference]: Finished difference Result 1846 states and 2982 transitions. [2025-03-03 16:09:49,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 16:09:49,215 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2025-03-03 16:09:49,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:09:49,220 INFO L225 Difference]: With dead ends: 1846 [2025-03-03 16:09:49,220 INFO L226 Difference]: Without dead ends: 1695 [2025-03-03 16:09:49,221 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-03-03 16:09:49,222 INFO L435 NwaCegarLoop]: 1536 mSDtfsCounter, 5964 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5964 SdHoareTripleChecker+Valid, 1792 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:09:49,222 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5964 Valid, 1792 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:09:49,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1695 states. [2025-03-03 16:09:49,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1695 to 1693. [2025-03-03 16:09:49,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1693 states, 1691 states have (on average 1.6203429923122412) internal successors, (2740), 1692 states have internal predecessors, (2740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:09:49,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1693 states to 1693 states and 2740 transitions. [2025-03-03 16:09:49,247 INFO L78 Accepts]: Start accepts. Automaton has 1693 states and 2740 transitions. Word has length 56 [2025-03-03 16:09:49,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:09:49,248 INFO L471 AbstractCegarLoop]: Abstraction has 1693 states and 2740 transitions. [2025-03-03 16:09:49,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:09:49,248 INFO L276 IsEmpty]: Start isEmpty. Operand 1693 states and 2740 transitions. [2025-03-03 16:09:49,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-03 16:09:49,249 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:09:49,249 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:09:49,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 16:09:49,249 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:09:49,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:09:49,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1917260214, now seen corresponding path program 1 times [2025-03-03 16:09:49,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:09:49,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099399437] [2025-03-03 16:09:49,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:09:49,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:09:49,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-03 16:09:49,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-03 16:09:49,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:09:49,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:09:49,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:09:49,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:09:49,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099399437] [2025-03-03 16:09:49,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099399437] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:09:49,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:09:49,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 16:09:49,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653961609] [2025-03-03 16:09:49,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:09:49,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 16:09:49,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:09:49,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 16:09:49,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 16:09:49,510 INFO L87 Difference]: Start difference. First operand 1693 states and 2740 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:09:49,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:09:49,554 INFO L93 Difference]: Finished difference Result 1701 states and 2749 transitions. [2025-03-03 16:09:49,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 16:09:49,555 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2025-03-03 16:09:49,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:09:49,560 INFO L225 Difference]: With dead ends: 1701 [2025-03-03 16:09:49,560 INFO L226 Difference]: Without dead ends: 1699 [2025-03-03 16:09:49,561 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 16:09:49,562 INFO L435 NwaCegarLoop]: 1537 mSDtfsCounter, 0 mSDsluCounter, 9209 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10746 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:09:49,562 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 10746 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:09:49,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1699 states. [2025-03-03 16:09:49,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1699 to 1699. [2025-03-03 16:09:49,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1699 states, 1697 states have (on average 1.6175604007071303) internal successors, (2745), 1698 states have internal predecessors, (2745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:09:49,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1699 states to 1699 states and 2745 transitions. [2025-03-03 16:09:49,590 INFO L78 Accepts]: Start accepts. Automaton has 1699 states and 2745 transitions. Word has length 57 [2025-03-03 16:09:49,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:09:49,590 INFO L471 AbstractCegarLoop]: Abstraction has 1699 states and 2745 transitions. [2025-03-03 16:09:49,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:09:49,590 INFO L276 IsEmpty]: Start isEmpty. Operand 1699 states and 2745 transitions. [2025-03-03 16:09:49,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-03 16:09:49,591 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:09:49,591 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:09:49,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 16:09:49,592 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:09:49,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:09:49,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1309029714, now seen corresponding path program 1 times [2025-03-03 16:09:49,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:09:49,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830106560] [2025-03-03 16:09:49,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:09:49,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:09:49,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-03 16:09:49,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-03 16:09:49,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:09:49,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:09:49,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:09:49,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:09:49,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830106560] [2025-03-03 16:09:49,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830106560] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:09:49,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:09:49,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:09:49,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395104308] [2025-03-03 16:09:49,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:09:49,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:09:49,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:09:49,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:09:49,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:09:49,647 INFO L87 Difference]: Start difference. First operand 1699 states and 2745 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:09:49,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:09:49,666 INFO L93 Difference]: Finished difference Result 1869 states and 3006 transitions. [2025-03-03 16:09:49,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:09:49,667 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2025-03-03 16:09:49,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:09:49,672 INFO L225 Difference]: With dead ends: 1869 [2025-03-03 16:09:49,672 INFO L226 Difference]: Without dead ends: 1781 [2025-03-03 16:09:49,673 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:09:49,673 INFO L435 NwaCegarLoop]: 1595 mSDtfsCounter, 1496 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1496 SdHoareTripleChecker+Valid, 1663 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:09:49,673 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1496 Valid, 1663 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:09:49,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1781 states. [2025-03-03 16:09:49,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1781 to 1779. [2025-03-03 16:09:49,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1779 states, 1777 states have (on average 1.6128306133933596) internal successors, (2866), 1778 states have internal predecessors, (2866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:09:49,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1779 states to 1779 states and 2866 transitions. [2025-03-03 16:09:49,699 INFO L78 Accepts]: Start accepts. Automaton has 1779 states and 2866 transitions. Word has length 58 [2025-03-03 16:09:49,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:09:49,700 INFO L471 AbstractCegarLoop]: Abstraction has 1779 states and 2866 transitions. [2025-03-03 16:09:49,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:09:49,700 INFO L276 IsEmpty]: Start isEmpty. Operand 1779 states and 2866 transitions. [2025-03-03 16:09:49,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-03 16:09:49,700 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:09:49,700 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:09:49,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 16:09:49,701 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:09:49,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:09:49,701 INFO L85 PathProgramCache]: Analyzing trace with hash 2007007086, now seen corresponding path program 1 times [2025-03-03 16:09:49,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:09:49,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378425554] [2025-03-03 16:09:49,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:09:49,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:09:49,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-03 16:09:49,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-03 16:09:49,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:09:49,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:09:49,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:09:49,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:09:49,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378425554] [2025-03-03 16:09:49,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378425554] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:09:49,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:09:49,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:09:49,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336118706] [2025-03-03 16:09:49,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:09:49,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:09:49,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:09:49,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:09:49,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:09:49,739 INFO L87 Difference]: Start difference. First operand 1779 states and 2866 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:09:49,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:09:49,757 INFO L93 Difference]: Finished difference Result 2225 states and 3546 transitions. [2025-03-03 16:09:49,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:09:49,757 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2025-03-03 16:09:49,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:09:49,762 INFO L225 Difference]: With dead ends: 2225 [2025-03-03 16:09:49,763 INFO L226 Difference]: Without dead ends: 1990 [2025-03-03 16:09:49,763 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:09:49,764 INFO L435 NwaCegarLoop]: 1597 mSDtfsCounter, 1494 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1494 SdHoareTripleChecker+Valid, 1669 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:09:49,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1494 Valid, 1669 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:09:49,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1990 states. [2025-03-03 16:09:49,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1990 to 1988. [2025-03-03 16:09:49,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1988 states, 1986 states have (on average 1.6002014098690835) internal successors, (3178), 1987 states have internal predecessors, (3178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:09:49,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1988 states to 1988 states and 3178 transitions. [2025-03-03 16:09:49,790 INFO L78 Accepts]: Start accepts. Automaton has 1988 states and 3178 transitions. Word has length 58 [2025-03-03 16:09:49,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:09:49,790 INFO L471 AbstractCegarLoop]: Abstraction has 1988 states and 3178 transitions. [2025-03-03 16:09:49,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:09:49,791 INFO L276 IsEmpty]: Start isEmpty. Operand 1988 states and 3178 transitions. [2025-03-03 16:09:49,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-03 16:09:49,791 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:09:49,791 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:09:49,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 16:09:49,791 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:09:49,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:09:49,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1559061550, now seen corresponding path program 1 times [2025-03-03 16:09:49,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:09:49,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520915155] [2025-03-03 16:09:49,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:09:49,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:09:49,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-03 16:09:49,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-03 16:09:49,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:09:49,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:09:49,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:09:49,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:09:49,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520915155] [2025-03-03 16:09:49,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520915155] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:09:49,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:09:49,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:09:49,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61435877] [2025-03-03 16:09:49,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:09:49,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:09:49,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:09:49,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:09:49,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:09:49,833 INFO L87 Difference]: Start difference. First operand 1988 states and 3178 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:09:49,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:09:49,855 INFO L93 Difference]: Finished difference Result 2828 states and 4440 transitions. [2025-03-03 16:09:49,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:09:49,856 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2025-03-03 16:09:49,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:09:49,862 INFO L225 Difference]: With dead ends: 2828 [2025-03-03 16:09:49,862 INFO L226 Difference]: Without dead ends: 2384 [2025-03-03 16:09:49,863 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:09:49,863 INFO L435 NwaCegarLoop]: 1595 mSDtfsCounter, 1492 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1492 SdHoareTripleChecker+Valid, 1671 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:09:49,864 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1492 Valid, 1671 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:09:49,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2384 states. [2025-03-03 16:09:49,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2384 to 2382. [2025-03-03 16:09:49,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2382 states, 2380 states have (on average 1.5773109243697478) internal successors, (3754), 2381 states have internal predecessors, (3754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:09:49,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2382 states to 2382 states and 3754 transitions. [2025-03-03 16:09:49,900 INFO L78 Accepts]: Start accepts. Automaton has 2382 states and 3754 transitions. Word has length 58 [2025-03-03 16:09:49,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:09:49,900 INFO L471 AbstractCegarLoop]: Abstraction has 2382 states and 3754 transitions. [2025-03-03 16:09:49,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:09:49,900 INFO L276 IsEmpty]: Start isEmpty. Operand 2382 states and 3754 transitions. [2025-03-03 16:09:49,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-03 16:09:49,901 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:09:49,901 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:09:49,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 16:09:49,901 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:09:49,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:09:49,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1974237422, now seen corresponding path program 1 times [2025-03-03 16:09:49,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:09:49,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562840686] [2025-03-03 16:09:49,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:09:49,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:09:49,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-03 16:09:49,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-03 16:09:49,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:09:49,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:09:49,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:09:49,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:09:49,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562840686] [2025-03-03 16:09:49,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562840686] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:09:49,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:09:49,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:09:49,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295144772] [2025-03-03 16:09:49,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:09:49,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:09:49,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:09:49,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:09:49,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:09:49,941 INFO L87 Difference]: Start difference. First operand 2382 states and 3754 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:09:49,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:09:49,973 INFO L93 Difference]: Finished difference Result 3962 states and 6084 transitions. [2025-03-03 16:09:49,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:09:49,973 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2025-03-03 16:09:49,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:09:49,981 INFO L225 Difference]: With dead ends: 3962 [2025-03-03 16:09:49,981 INFO L226 Difference]: Without dead ends: 3124 [2025-03-03 16:09:49,983 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:09:49,983 INFO L435 NwaCegarLoop]: 1593 mSDtfsCounter, 1490 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1490 SdHoareTripleChecker+Valid, 1673 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:09:49,983 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1490 Valid, 1673 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:09:49,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3124 states. [2025-03-03 16:09:50,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3124 to 3122. [2025-03-03 16:09:50,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3122 states, 3120 states have (on average 1.5416666666666667) internal successors, (4810), 3121 states have internal predecessors, (4810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:09:50,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 3122 states and 4810 transitions. [2025-03-03 16:09:50,035 INFO L78 Accepts]: Start accepts. Automaton has 3122 states and 4810 transitions. Word has length 58 [2025-03-03 16:09:50,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:09:50,035 INFO L471 AbstractCegarLoop]: Abstraction has 3122 states and 4810 transitions. [2025-03-03 16:09:50,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:09:50,035 INFO L276 IsEmpty]: Start isEmpty. Operand 3122 states and 4810 transitions. [2025-03-03 16:09:50,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-03 16:09:50,036 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:09:50,036 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:09:50,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 16:09:50,036 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:09:50,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:09:50,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1487519150, now seen corresponding path program 1 times [2025-03-03 16:09:50,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:09:50,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74685672] [2025-03-03 16:09:50,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:09:50,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:09:50,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-03 16:09:50,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-03 16:09:50,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:09:50,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:09:50,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:09:50,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:09:50,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74685672] [2025-03-03 16:09:50,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74685672] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:09:50,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:09:50,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:09:50,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362594451] [2025-03-03 16:09:50,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:09:50,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:09:50,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:09:50,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:09:50,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:09:50,080 INFO L87 Difference]: Start difference. First operand 3122 states and 4810 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:09:50,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:09:50,122 INFO L93 Difference]: Finished difference Result 6086 states and 9084 transitions. [2025-03-03 16:09:50,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:09:50,122 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2025-03-03 16:09:50,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:09:50,140 INFO L225 Difference]: With dead ends: 6086 [2025-03-03 16:09:50,140 INFO L226 Difference]: Without dead ends: 4508 [2025-03-03 16:09:50,146 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:09:50,146 INFO L435 NwaCegarLoop]: 1591 mSDtfsCounter, 1488 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1488 SdHoareTripleChecker+Valid, 1675 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:09:50,146 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1488 Valid, 1675 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:09:50,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4508 states. [2025-03-03 16:09:50,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4508 to 4506. [2025-03-03 16:09:50,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4506 states, 4504 states have (on average 1.494227353463588) internal successors, (6730), 4505 states have internal predecessors, (6730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:09:50,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4506 states to 4506 states and 6730 transitions. [2025-03-03 16:09:50,233 INFO L78 Accepts]: Start accepts. Automaton has 4506 states and 6730 transitions. Word has length 58 [2025-03-03 16:09:50,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:09:50,233 INFO L471 AbstractCegarLoop]: Abstraction has 4506 states and 6730 transitions. [2025-03-03 16:09:50,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:09:50,233 INFO L276 IsEmpty]: Start isEmpty. Operand 4506 states and 6730 transitions. [2025-03-03 16:09:50,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-03 16:09:50,238 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:09:50,239 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:09:50,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 16:09:50,239 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:09:50,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:09:50,239 INFO L85 PathProgramCache]: Analyzing trace with hash -926993275, now seen corresponding path program 1 times [2025-03-03 16:09:50,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:09:50,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307109010] [2025-03-03 16:09:50,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:09:50,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:09:50,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-03 16:09:50,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-03 16:09:50,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:09:50,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:09:50,354 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 16:09:50,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:09:50,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307109010] [2025-03-03 16:09:50,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307109010] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:09:50,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:09:50,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 16:09:50,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516196130] [2025-03-03 16:09:50,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:09:50,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 16:09:50,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:09:50,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 16:09:50,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 16:09:50,355 INFO L87 Difference]: Start difference. First operand 4506 states and 6730 transitions. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:09:50,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:09:50,624 INFO L93 Difference]: Finished difference Result 19110 states and 27536 transitions. [2025-03-03 16:09:50,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 16:09:50,625 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-03-03 16:09:50,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:09:50,654 INFO L225 Difference]: With dead ends: 19110 [2025-03-03 16:09:50,654 INFO L226 Difference]: Without dead ends: 16996 [2025-03-03 16:09:50,660 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-03 16:09:50,661 INFO L435 NwaCegarLoop]: 1607 mSDtfsCounter, 6305 mSDsluCounter, 2109 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6305 SdHoareTripleChecker+Valid, 3716 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:09:50,661 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6305 Valid, 3716 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:09:50,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16996 states. [2025-03-03 16:09:50,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16996 to 7050. [2025-03-03 16:09:50,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7050 states, 7048 states have (on average 1.4633938706015892) internal successors, (10314), 7049 states have internal predecessors, (10314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:09:50,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7050 states to 7050 states and 10314 transitions. [2025-03-03 16:09:50,840 INFO L78 Accepts]: Start accepts. Automaton has 7050 states and 10314 transitions. Word has length 77 [2025-03-03 16:09:50,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:09:50,841 INFO L471 AbstractCegarLoop]: Abstraction has 7050 states and 10314 transitions. [2025-03-03 16:09:50,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:09:50,841 INFO L276 IsEmpty]: Start isEmpty. Operand 7050 states and 10314 transitions. [2025-03-03 16:09:50,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-03 16:09:50,843 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:09:50,843 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:09:50,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 16:09:50,844 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:09:50,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:09:50,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1905923771, now seen corresponding path program 1 times [2025-03-03 16:09:50,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:09:50,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904359547] [2025-03-03 16:09:50,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:09:50,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:09:50,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-03 16:09:50,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-03 16:09:50,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:09:50,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:09:50,955 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 16:09:50,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:09:50,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904359547] [2025-03-03 16:09:50,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904359547] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:09:50,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:09:50,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 16:09:50,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68216446] [2025-03-03 16:09:50,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:09:50,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 16:09:50,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:09:50,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 16:09:50,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 16:09:50,956 INFO L87 Difference]: Start difference. First operand 7050 states and 10314 transitions. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:09:51,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:09:51,220 INFO L93 Difference]: Finished difference Result 22070 states and 31728 transitions. [2025-03-03 16:09:51,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 16:09:51,220 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-03-03 16:09:51,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:09:51,292 INFO L225 Difference]: With dead ends: 22070 [2025-03-03 16:09:51,292 INFO L226 Difference]: Without dead ends: 19108 [2025-03-03 16:09:51,297 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-03 16:09:51,297 INFO L435 NwaCegarLoop]: 1606 mSDtfsCounter, 6307 mSDsluCounter, 2079 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6307 SdHoareTripleChecker+Valid, 3685 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:09:51,297 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6307 Valid, 3685 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:09:51,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19108 states. [2025-03-03 16:09:51,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19108 to 11066. [2025-03-03 16:09:51,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11066 states, 11064 states have (on average 1.4426970354302242) internal successors, (15962), 11065 states have internal predecessors, (15962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:09:51,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11066 states to 11066 states and 15962 transitions. [2025-03-03 16:09:51,497 INFO L78 Accepts]: Start accepts. Automaton has 11066 states and 15962 transitions. Word has length 77 [2025-03-03 16:09:51,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:09:51,497 INFO L471 AbstractCegarLoop]: Abstraction has 11066 states and 15962 transitions. [2025-03-03 16:09:51,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:09:51,497 INFO L276 IsEmpty]: Start isEmpty. Operand 11066 states and 15962 transitions. [2025-03-03 16:09:51,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-03 16:09:51,499 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:09:51,499 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:09:51,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 16:09:51,500 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:09:51,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:09:51,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1941097989, now seen corresponding path program 1 times [2025-03-03 16:09:51,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:09:51,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7263740] [2025-03-03 16:09:51,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:09:51,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:09:51,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-03 16:09:51,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-03 16:09:51,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:09:51,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:09:51,600 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 16:09:51,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:09:51,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7263740] [2025-03-03 16:09:51,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7263740] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:09:51,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:09:51,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 16:09:51,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543996496] [2025-03-03 16:09:51,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:09:51,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 16:09:51,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:09:51,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 16:09:51,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 16:09:51,602 INFO L87 Difference]: Start difference. First operand 11066 states and 15962 transitions. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:09:51,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:09:51,948 INFO L93 Difference]: Finished difference Result 25030 states and 35904 transitions. [2025-03-03 16:09:51,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 16:09:51,948 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-03-03 16:09:51,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:09:51,984 INFO L225 Difference]: With dead ends: 25030 [2025-03-03 16:09:51,985 INFO L226 Difference]: Without dead ends: 22068 [2025-03-03 16:09:51,990 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-03 16:09:51,991 INFO L435 NwaCegarLoop]: 1604 mSDtfsCounter, 6331 mSDsluCounter, 2029 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6331 SdHoareTripleChecker+Valid, 3633 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:09:51,991 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6331 Valid, 3633 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:09:52,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22068 states. [2025-03-03 16:09:52,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22068 to 14026. [2025-03-03 16:09:52,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14026 states, 14024 states have (on average 1.4359669138619509) internal successors, (20138), 14025 states have internal predecessors, (20138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:09:52,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14026 states to 14026 states and 20138 transitions. [2025-03-03 16:09:52,340 INFO L78 Accepts]: Start accepts. Automaton has 14026 states and 20138 transitions. Word has length 77 [2025-03-03 16:09:52,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:09:52,340 INFO L471 AbstractCegarLoop]: Abstraction has 14026 states and 20138 transitions. [2025-03-03 16:09:52,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:09:52,340 INFO L276 IsEmpty]: Start isEmpty. Operand 14026 states and 20138 transitions. [2025-03-03 16:09:52,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-03 16:09:52,342 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:09:52,342 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:09:52,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 16:09:52,343 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:09:52,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:09:52,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1938693435, now seen corresponding path program 1 times [2025-03-03 16:09:52,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:09:52,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316228583] [2025-03-03 16:09:52,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:09:52,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:09:52,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-03 16:09:52,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-03 16:09:52,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:09:52,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:09:52,458 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-03 16:09:52,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:09:52,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316228583] [2025-03-03 16:09:52,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316228583] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:09:52,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:09:52,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 16:09:52,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28889601] [2025-03-03 16:09:52,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:09:52,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 16:09:52,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:09:52,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 16:09:52,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 16:09:52,460 INFO L87 Difference]: Start difference. First operand 14026 states and 20138 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:09:52,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:09:52,823 INFO L93 Difference]: Finished difference Result 27990 states and 40080 transitions. [2025-03-03 16:09:52,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 16:09:52,823 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-03-03 16:09:52,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:09:52,856 INFO L225 Difference]: With dead ends: 27990 [2025-03-03 16:09:52,856 INFO L226 Difference]: Without dead ends: 25028 [2025-03-03 16:09:52,862 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-03 16:09:52,862 INFO L435 NwaCegarLoop]: 1602 mSDtfsCounter, 6369 mSDsluCounter, 2024 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6369 SdHoareTripleChecker+Valid, 3626 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:09:52,863 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6369 Valid, 3626 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:09:52,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25028 states. [2025-03-03 16:09:53,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25028 to 16986. [2025-03-03 16:09:53,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16986 states, 16984 states have (on average 1.4315826660386246) internal successors, (24314), 16985 states have internal predecessors, (24314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:09:53,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16986 states to 16986 states and 24314 transitions. [2025-03-03 16:09:53,168 INFO L78 Accepts]: Start accepts. Automaton has 16986 states and 24314 transitions. Word has length 77 [2025-03-03 16:09:53,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:09:53,169 INFO L471 AbstractCegarLoop]: Abstraction has 16986 states and 24314 transitions. [2025-03-03 16:09:53,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:09:53,169 INFO L276 IsEmpty]: Start isEmpty. Operand 16986 states and 24314 transitions. [2025-03-03 16:09:53,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-03 16:09:53,171 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:09:53,171 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:09:53,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 16:09:53,171 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:09:53,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:09:53,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1869555589, now seen corresponding path program 1 times [2025-03-03 16:09:53,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:09:53,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349876915] [2025-03-03 16:09:53,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:09:53,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:09:53,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-03 16:09:53,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-03 16:09:53,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:09:53,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:09:53,275 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-03 16:09:53,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:09:53,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349876915] [2025-03-03 16:09:53,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349876915] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:09:53,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:09:53,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 16:09:53,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591973670] [2025-03-03 16:09:53,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:09:53,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 16:09:53,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:09:53,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 16:09:53,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 16:09:53,277 INFO L87 Difference]: Start difference. First operand 16986 states and 24314 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:09:53,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:09:53,675 INFO L93 Difference]: Finished difference Result 30950 states and 44256 transitions. [2025-03-03 16:09:53,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 16:09:53,675 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-03-03 16:09:53,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:09:53,709 INFO L225 Difference]: With dead ends: 30950 [2025-03-03 16:09:53,710 INFO L226 Difference]: Without dead ends: 27988 [2025-03-03 16:09:53,718 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-03 16:09:53,719 INFO L435 NwaCegarLoop]: 1601 mSDtfsCounter, 6327 mSDsluCounter, 2074 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6327 SdHoareTripleChecker+Valid, 3675 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:09:53,719 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6327 Valid, 3675 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:09:53,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27988 states. [2025-03-03 16:09:54,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27988 to 19946. [2025-03-03 16:09:54,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19946 states, 19944 states have (on average 1.4284997994384276) internal successors, (28490), 19945 states have internal predecessors, (28490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:09:54,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19946 states to 19946 states and 28490 transitions. [2025-03-03 16:09:54,160 INFO L78 Accepts]: Start accepts. Automaton has 19946 states and 28490 transitions. Word has length 77 [2025-03-03 16:09:54,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:09:54,160 INFO L471 AbstractCegarLoop]: Abstraction has 19946 states and 28490 transitions. [2025-03-03 16:09:54,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:09:54,160 INFO L276 IsEmpty]: Start isEmpty. Operand 19946 states and 28490 transitions. [2025-03-03 16:09:54,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-03 16:09:54,164 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:09:54,164 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:09:54,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 16:09:54,164 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:09:54,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:09:54,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1735618441, now seen corresponding path program 1 times [2025-03-03 16:09:54,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:09:54,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249869833] [2025-03-03 16:09:54,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:09:54,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:09:54,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-03 16:09:54,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-03 16:09:54,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:09:54,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:09:54,232 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:09:54,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:09:54,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249869833] [2025-03-03 16:09:54,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249869833] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:09:54,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:09:54,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:09:54,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408417029] [2025-03-03 16:09:54,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:09:54,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:09:54,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:09:54,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:09:54,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:09:54,237 INFO L87 Difference]: Start difference. First operand 19946 states and 28490 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:09:54,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:09:54,466 INFO L93 Difference]: Finished difference Result 38350 states and 54476 transitions. [2025-03-03 16:09:54,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:09:54,466 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-03-03 16:09:54,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:09:54,491 INFO L225 Difference]: With dead ends: 38350 [2025-03-03 16:09:54,491 INFO L226 Difference]: Without dead ends: 19948 [2025-03-03 16:09:54,508 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:09:54,508 INFO L435 NwaCegarLoop]: 1577 mSDtfsCounter, 45 mSDsluCounter, 1531 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 3108 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:09:54,509 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 3108 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:09:54,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19948 states. [2025-03-03 16:09:54,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19948 to 19946. [2025-03-03 16:09:54,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19946 states, 19944 states have (on average 1.4136582430806257) internal successors, (28194), 19945 states have internal predecessors, (28194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:09:55,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19946 states to 19946 states and 28194 transitions. [2025-03-03 16:09:55,004 INFO L78 Accepts]: Start accepts. Automaton has 19946 states and 28194 transitions. Word has length 78 [2025-03-03 16:09:55,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:09:55,004 INFO L471 AbstractCegarLoop]: Abstraction has 19946 states and 28194 transitions. [2025-03-03 16:09:55,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:09:55,004 INFO L276 IsEmpty]: Start isEmpty. Operand 19946 states and 28194 transitions. [2025-03-03 16:09:55,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 16:09:55,006 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:09:55,006 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:09:55,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 16:09:55,006 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:09:55,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:09:55,007 INFO L85 PathProgramCache]: Analyzing trace with hash -783999357, now seen corresponding path program 1 times [2025-03-03 16:09:55,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:09:55,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585361200] [2025-03-03 16:09:55,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:09:55,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:09:55,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 16:09:55,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 16:09:55,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:09:55,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:09:55,089 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:09:55,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:09:55,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585361200] [2025-03-03 16:09:55,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585361200] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:09:55,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:09:55,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:09:55,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427870404] [2025-03-03 16:09:55,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:09:55,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:09:55,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:09:55,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:09:55,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:09:55,091 INFO L87 Difference]: Start difference. First operand 19946 states and 28194 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:09:55,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:09:55,264 INFO L93 Difference]: Finished difference Result 26833 states and 37888 transitions. [2025-03-03 16:09:55,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:09:55,265 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2025-03-03 16:09:55,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:09:55,278 INFO L225 Difference]: With dead ends: 26833 [2025-03-03 16:09:55,279 INFO L226 Difference]: Without dead ends: 8431 [2025-03-03 16:09:55,292 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:09:55,292 INFO L435 NwaCegarLoop]: 1575 mSDtfsCounter, 39 mSDsluCounter, 1530 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 3105 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:09:55,293 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 3105 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:09:55,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8431 states. [2025-03-03 16:09:55,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8431 to 8423. [2025-03-03 16:09:55,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8423 states, 8421 states have (on average 1.4353402208763806) internal successors, (12087), 8422 states have internal predecessors, (12087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:09:55,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8423 states to 8423 states and 12087 transitions. [2025-03-03 16:09:55,492 INFO L78 Accepts]: Start accepts. Automaton has 8423 states and 12087 transitions. Word has length 79 [2025-03-03 16:09:55,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:09:55,494 INFO L471 AbstractCegarLoop]: Abstraction has 8423 states and 12087 transitions. [2025-03-03 16:09:55,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:09:55,494 INFO L276 IsEmpty]: Start isEmpty. Operand 8423 states and 12087 transitions. [2025-03-03 16:09:55,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-03 16:09:55,495 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:09:55,496 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:09:55,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 16:09:55,496 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:09:55,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:09:55,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1691147440, now seen corresponding path program 1 times [2025-03-03 16:09:55,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:09:55,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862679633] [2025-03-03 16:09:55,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:09:55,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:09:55,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-03 16:09:55,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-03 16:09:55,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:09:55,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:09:55,578 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:09:55,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:09:55,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862679633] [2025-03-03 16:09:55,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862679633] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:09:55,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:09:55,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:09:55,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636772472] [2025-03-03 16:09:55,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:09:55,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:09:55,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:09:55,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:09:55,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:09:55,579 INFO L87 Difference]: Start difference. First operand 8423 states and 12087 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:09:55,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:09:55,666 INFO L93 Difference]: Finished difference Result 11859 states and 16873 transitions. [2025-03-03 16:09:55,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:09:55,666 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2025-03-03 16:09:55,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:09:55,675 INFO L225 Difference]: With dead ends: 11859 [2025-03-03 16:09:55,675 INFO L226 Difference]: Without dead ends: 4993 [2025-03-03 16:09:55,682 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:09:55,682 INFO L435 NwaCegarLoop]: 1569 mSDtfsCounter, 41 mSDsluCounter, 1515 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 3084 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:09:55,683 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 3084 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:09:55,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4993 states. [2025-03-03 16:09:55,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4993 to 4991. [2025-03-03 16:09:55,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4991 states, 4989 states have (on average 1.4533974744437763) internal successors, (7251), 4990 states have internal predecessors, (7251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:09:55,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4991 states to 4991 states and 7251 transitions. [2025-03-03 16:09:55,796 INFO L78 Accepts]: Start accepts. Automaton has 4991 states and 7251 transitions. Word has length 80 [2025-03-03 16:09:55,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:09:55,797 INFO L471 AbstractCegarLoop]: Abstraction has 4991 states and 7251 transitions. [2025-03-03 16:09:55,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:09:55,797 INFO L276 IsEmpty]: Start isEmpty. Operand 4991 states and 7251 transitions. [2025-03-03 16:09:55,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-03 16:09:55,798 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:09:55,798 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:09:55,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 16:09:55,799 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:09:55,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:09:55,799 INFO L85 PathProgramCache]: Analyzing trace with hash 234523383, now seen corresponding path program 1 times [2025-03-03 16:09:55,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:09:55,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883784116] [2025-03-03 16:09:55,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:09:55,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:09:55,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-03 16:09:55,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-03 16:09:55,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:09:55,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:09:55,874 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:09:55,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:09:55,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883784116] [2025-03-03 16:09:55,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883784116] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:09:55,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:09:55,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:09:55,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293358136] [2025-03-03 16:09:55,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:09:55,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:09:55,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:09:55,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:09:55,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:09:55,877 INFO L87 Difference]: Start difference. First operand 4991 states and 7251 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:09:55,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:09:55,931 INFO L93 Difference]: Finished difference Result 6711 states and 9619 transitions. [2025-03-03 16:09:55,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:09:55,931 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2025-03-03 16:09:55,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:09:55,938 INFO L225 Difference]: With dead ends: 6711 [2025-03-03 16:09:55,938 INFO L226 Difference]: Without dead ends: 3277 [2025-03-03 16:09:55,941 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:09:55,942 INFO L435 NwaCegarLoop]: 1562 mSDtfsCounter, 38 mSDsluCounter, 1507 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 3069 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:09:55,942 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 3069 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:09:55,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3277 states. [2025-03-03 16:09:55,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3277 to 3275. [2025-03-03 16:09:56,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3275 states, 3273 states have (on average 1.4845707302169264) internal successors, (4859), 3274 states have internal predecessors, (4859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:09:56,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3275 states to 3275 states and 4859 transitions. [2025-03-03 16:09:56,008 INFO L78 Accepts]: Start accepts. Automaton has 3275 states and 4859 transitions. Word has length 82 [2025-03-03 16:09:56,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:09:56,009 INFO L471 AbstractCegarLoop]: Abstraction has 3275 states and 4859 transitions. [2025-03-03 16:09:56,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:09:56,009 INFO L276 IsEmpty]: Start isEmpty. Operand 3275 states and 4859 transitions. [2025-03-03 16:09:56,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-03 16:09:56,010 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:09:56,010 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:09:56,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 16:09:56,010 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:09:56,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:09:56,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1533089186, now seen corresponding path program 1 times [2025-03-03 16:09:56,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:09:56,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933399763] [2025-03-03 16:09:56,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:09:56,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:09:56,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-03 16:09:56,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-03 16:09:56,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:09:56,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:09:56,088 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:09:56,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:09:56,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933399763] [2025-03-03 16:09:56,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933399763] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:09:56,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:09:56,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:09:56,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484780438] [2025-03-03 16:09:56,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:09:56,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:09:56,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:09:56,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:09:56,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:09:56,091 INFO L87 Difference]: Start difference. First operand 3275 states and 4859 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:09:56,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:09:56,128 INFO L93 Difference]: Finished difference Result 4137 states and 6031 transitions. [2025-03-03 16:09:56,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:09:56,130 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2025-03-03 16:09:56,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:09:56,135 INFO L225 Difference]: With dead ends: 4137 [2025-03-03 16:09:56,135 INFO L226 Difference]: Without dead ends: 2419 [2025-03-03 16:09:56,137 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:09:56,138 INFO L435 NwaCegarLoop]: 1555 mSDtfsCounter, 35 mSDsluCounter, 1499 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 3054 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:09:56,138 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 3054 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:09:56,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2419 states. [2025-03-03 16:09:56,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2419 to 2417. [2025-03-03 16:09:56,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2417 states, 2415 states have (on average 1.522153209109731) internal successors, (3676), 2416 states have internal predecessors, (3676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:09:56,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2417 states to 2417 states and 3676 transitions. [2025-03-03 16:09:56,178 INFO L78 Accepts]: Start accepts. Automaton has 2417 states and 3676 transitions. Word has length 84 [2025-03-03 16:09:56,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:09:56,178 INFO L471 AbstractCegarLoop]: Abstraction has 2417 states and 3676 transitions. [2025-03-03 16:09:56,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:09:56,178 INFO L276 IsEmpty]: Start isEmpty. Operand 2417 states and 3676 transitions. [2025-03-03 16:09:56,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-03 16:09:56,179 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:09:56,179 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:09:56,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 16:09:56,179 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:09:56,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:09:56,180 INFO L85 PathProgramCache]: Analyzing trace with hash 296643301, now seen corresponding path program 1 times [2025-03-03 16:09:56,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:09:56,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304462100] [2025-03-03 16:09:56,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:09:56,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:09:56,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-03 16:09:56,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-03 16:09:56,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:09:56,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:09:56,274 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 16:09:56,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:09:56,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304462100] [2025-03-03 16:09:56,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304462100] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:09:56,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [653097706] [2025-03-03 16:09:56,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:09:56,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:09:56,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:09:56,277 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:09:56,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 16:09:56,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-03 16:09:56,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-03 16:09:56,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:09:56,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:09:56,379 INFO L256 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 16:09:56,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:09:56,790 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:09:56,791 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:09:57,420 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:09:57,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [653097706] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:09:57,420 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:09:57,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 9, 9] total 20 [2025-03-03 16:09:57,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176125483] [2025-03-03 16:09:57,421 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:09:57,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-03 16:09:57,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:09:57,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-03 16:09:57,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2025-03-03 16:09:57,422 INFO L87 Difference]: Start difference. First operand 2417 states and 3676 transitions. Second operand has 20 states, 20 states have (on average 11.45) internal successors, (229), 20 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:09:58,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:09:58,025 INFO L93 Difference]: Finished difference Result 5073 states and 7164 transitions. [2025-03-03 16:09:58,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-03 16:09:58,026 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 11.45) internal successors, (229), 20 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2025-03-03 16:09:58,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:09:58,031 INFO L225 Difference]: With dead ends: 5073 [2025-03-03 16:09:58,032 INFO L226 Difference]: Without dead ends: 4213 [2025-03-03 16:09:58,033 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=358, Invalid=1124, Unknown=0, NotChecked=0, Total=1482 [2025-03-03 16:09:58,034 INFO L435 NwaCegarLoop]: 1513 mSDtfsCounter, 18769 mSDsluCounter, 3336 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18769 SdHoareTripleChecker+Valid, 4849 SdHoareTripleChecker+Invalid, 497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 16:09:58,034 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18769 Valid, 4849 Invalid, 497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 16:09:58,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4213 states. [2025-03-03 16:09:58,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4213 to 4033. [2025-03-03 16:09:58,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4033 states, 4031 states have (on average 1.4145373356487223) internal successors, (5702), 4032 states have internal predecessors, (5702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:09:58,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4033 states to 4033 states and 5702 transitions. [2025-03-03 16:09:58,093 INFO L78 Accepts]: Start accepts. Automaton has 4033 states and 5702 transitions. Word has length 86 [2025-03-03 16:09:58,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:09:58,093 INFO L471 AbstractCegarLoop]: Abstraction has 4033 states and 5702 transitions. [2025-03-03 16:09:58,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 11.45) internal successors, (229), 20 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:09:58,093 INFO L276 IsEmpty]: Start isEmpty. Operand 4033 states and 5702 transitions. [2025-03-03 16:09:58,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-03 16:09:58,094 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:09:58,094 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:09:58,102 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 16:09:58,295 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,SelfDestructingSolverStorable22 [2025-03-03 16:09:58,295 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:09:58,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:09:58,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1562871412, now seen corresponding path program 1 times [2025-03-03 16:09:58,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:09:58,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008239880] [2025-03-03 16:09:58,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:09:58,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:09:58,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-03 16:09:58,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-03 16:09:58,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:09:58,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:09:58,678 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:09:58,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:09:58,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008239880] [2025-03-03 16:09:58,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008239880] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:09:58,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [214092167] [2025-03-03 16:09:58,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:09:58,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:09:58,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:09:58,680 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-03 16:09:58,681 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-03 16:09:58,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-03 16:09:58,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-03 16:09:58,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:09:58,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:09:58,775 INFO L256 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 16:09:58,777 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:09:59,137 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:09:59,137 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:09:59,749 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:09:59,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [214092167] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:09:59,750 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:09:59,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2025-03-03 16:09:59,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891160905] [2025-03-03 16:09:59,750 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:09:59,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-03 16:09:59,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:09:59,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-03 16:09:59,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=514, Unknown=0, NotChecked=0, Total=600 [2025-03-03 16:09:59,751 INFO L87 Difference]: Start difference. First operand 4033 states and 5702 transitions. Second operand has 25 states, 25 states have (on average 9.64) internal successors, (241), 24 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:10:00,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:10:00,825 INFO L93 Difference]: Finished difference Result 12481 states and 16728 transitions. [2025-03-03 16:10:00,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-03 16:10:00,826 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 9.64) internal successors, (241), 24 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2025-03-03 16:10:00,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:10:00,835 INFO L225 Difference]: With dead ends: 12481 [2025-03-03 16:10:00,835 INFO L226 Difference]: Without dead ends: 10134 [2025-03-03 16:10:00,838 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 461 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=494, Invalid=1956, Unknown=0, NotChecked=0, Total=2450 [2025-03-03 16:10:00,839 INFO L435 NwaCegarLoop]: 1510 mSDtfsCounter, 24509 mSDsluCounter, 6547 mSDsCounter, 0 mSdLazyCounter, 708 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24509 SdHoareTripleChecker+Valid, 8057 SdHoareTripleChecker+Invalid, 748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 16:10:00,839 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24509 Valid, 8057 Invalid, 748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 708 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 16:10:00,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10134 states. [2025-03-03 16:10:00,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10134 to 8330. [2025-03-03 16:10:00,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8330 states, 8328 states have (on average 1.339817483189241) internal successors, (11158), 8329 states have internal predecessors, (11158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:10:00,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8330 states to 8330 states and 11158 transitions. [2025-03-03 16:10:00,987 INFO L78 Accepts]: Start accepts. Automaton has 8330 states and 11158 transitions. Word has length 87 [2025-03-03 16:10:00,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:10:00,987 INFO L471 AbstractCegarLoop]: Abstraction has 8330 states and 11158 transitions. [2025-03-03 16:10:00,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 9.64) internal successors, (241), 24 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:10:00,988 INFO L276 IsEmpty]: Start isEmpty. Operand 8330 states and 11158 transitions. [2025-03-03 16:10:00,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-03 16:10:00,989 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:10:00,989 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:10:00,995 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 16:10:01,189 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,SelfDestructingSolverStorable23 [2025-03-03 16:10:01,189 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:10:01,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:10:01,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1784058686, now seen corresponding path program 1 times [2025-03-03 16:10:01,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:10:01,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634298661] [2025-03-03 16:10:01,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:10:01,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:10:01,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-03 16:10:01,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-03 16:10:01,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:10:01,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:10:01,440 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:10:01,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:10:01,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634298661] [2025-03-03 16:10:01,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634298661] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:10:01,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1989695705] [2025-03-03 16:10:01,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:10:01,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:10:01,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:10:01,442 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-03 16:10:01,443 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-03 16:10:01,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-03 16:10:01,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-03 16:10:01,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:10:01,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:10:01,538 INFO L256 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 16:10:01,540 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:10:01,800 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:10:01,800 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:10:02,299 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:10:02,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1989695705] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:10:02,299 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:10:02,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2025-03-03 16:10:02,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443477869] [2025-03-03 16:10:02,299 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:10:02,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-03 16:10:02,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:10:02,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-03 16:10:02,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=517, Unknown=0, NotChecked=0, Total=600 [2025-03-03 16:10:02,302 INFO L87 Difference]: Start difference. First operand 8330 states and 11158 transitions. Second operand has 25 states, 25 states have (on average 8.96) internal successors, (224), 24 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:10:03,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:10:03,982 INFO L93 Difference]: Finished difference Result 46126 states and 60174 transitions. [2025-03-03 16:10:03,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-03-03 16:10:03,982 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 8.96) internal successors, (224), 24 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2025-03-03 16:10:03,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:10:04,023 INFO L225 Difference]: With dead ends: 46126 [2025-03-03 16:10:04,023 INFO L226 Difference]: Without dead ends: 39753 [2025-03-03 16:10:04,037 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 766 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=690, Invalid=2970, Unknown=0, NotChecked=0, Total=3660 [2025-03-03 16:10:04,037 INFO L435 NwaCegarLoop]: 1545 mSDtfsCounter, 17666 mSDsluCounter, 8595 mSDsCounter, 0 mSdLazyCounter, 1317 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17666 SdHoareTripleChecker+Valid, 10140 SdHoareTripleChecker+Invalid, 1341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 16:10:04,037 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17666 Valid, 10140 Invalid, 1341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1317 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 16:10:04,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39753 states. [2025-03-03 16:10:04,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39753 to 27879. [2025-03-03 16:10:04,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27879 states, 27877 states have (on average 1.2806973490691251) internal successors, (35702), 27878 states have internal predecessors, (35702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:10:04,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27879 states to 27879 states and 35702 transitions. [2025-03-03 16:10:04,687 INFO L78 Accepts]: Start accepts. Automaton has 27879 states and 35702 transitions. Word has length 88 [2025-03-03 16:10:04,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:10:04,687 INFO L471 AbstractCegarLoop]: Abstraction has 27879 states and 35702 transitions. [2025-03-03 16:10:04,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 8.96) internal successors, (224), 24 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:10:04,687 INFO L276 IsEmpty]: Start isEmpty. Operand 27879 states and 35702 transitions. [2025-03-03 16:10:04,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-03 16:10:04,689 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:10:04,689 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:10:04,695 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-03 16:10:04,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:10:04,890 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:10:04,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:10:04,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1917138110, now seen corresponding path program 1 times [2025-03-03 16:10:04,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:10:04,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540786629] [2025-03-03 16:10:04,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:10:04,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:10:04,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 16:10:04,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 16:10:04,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:10:04,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:10:07,575 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:10:07,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:10:07,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540786629] [2025-03-03 16:10:07,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540786629] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:10:07,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1570251863] [2025-03-03 16:10:07,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:10:07,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:10:07,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:10:07,578 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-03 16:10:07,580 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-03 16:10:07,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 16:10:07,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 16:10:07,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:10:07,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:10:07,705 INFO L256 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 73 conjuncts are in the unsatisfiable core [2025-03-03 16:10:07,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:10:13,496 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:10:13,497 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:10:21,000 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:10:21,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1570251863] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:10:21,000 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:10:21,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 36, 31] total 96 [2025-03-03 16:10:21,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668360622] [2025-03-03 16:10:21,000 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:10:21,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2025-03-03 16:10:21,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:10:21,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2025-03-03 16:10:21,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1045, Invalid=8075, Unknown=0, NotChecked=0, Total=9120 [2025-03-03 16:10:21,009 INFO L87 Difference]: Start difference. First operand 27879 states and 35702 transitions. Second operand has 96 states, 96 states have (on average 2.6666666666666665) internal successors, (256), 96 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)