./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem13_label37.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/eca-rers2012/Problem13_label37.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 a60dbc2f79c578f373d1608befa1a0be5fe97eed98271e53ccf8c768ad5b972e --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 10:43:37,922 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 10:43:37,962 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 10:43:37,967 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 10:43:37,969 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 10:43:37,987 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 10:43:37,988 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 10:43:37,988 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 10:43:37,989 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 10:43:37,989 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 10:43:37,989 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 10:43:37,989 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 10:43:37,989 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 10:43:37,989 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 10:43:37,989 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 10:43:37,989 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 10:43:37,989 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 10:43:37,989 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 10:43:37,990 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 10:43:37,990 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 10:43:37,990 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 10:43:37,990 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 10:43:37,990 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 10:43:37,990 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 10:43:37,990 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 10:43:37,990 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 10:43:37,990 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 10:43:37,990 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 10:43:37,990 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 10:43:37,990 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 10:43:37,990 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 10:43:37,990 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 10:43:37,990 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:43:37,990 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 10:43:37,990 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 10:43:37,990 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 10:43:37,990 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 10:43:37,990 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 10:43:37,991 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 10:43:37,991 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 10:43:37,991 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 10:43:37,991 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 10:43:37,991 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 10:43:37,991 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 -> a60dbc2f79c578f373d1608befa1a0be5fe97eed98271e53ccf8c768ad5b972e [2025-03-03 10:43:38,217 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 10:43:38,222 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 10:43:38,224 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 10:43:38,225 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 10:43:38,225 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 10:43:38,226 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem13_label37.c [2025-03-03 10:43:39,341 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6259217a/aa7a783c63784429b9eca3857b2be2e6/FLAGcf7c07776 [2025-03-03 10:43:39,769 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 10:43:39,771 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label37.c [2025-03-03 10:43:39,802 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6259217a/aa7a783c63784429b9eca3857b2be2e6/FLAGcf7c07776 [2025-03-03 10:43:39,815 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6259217a/aa7a783c63784429b9eca3857b2be2e6 [2025-03-03 10:43:39,818 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 10:43:39,819 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 10:43:39,820 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 10:43:39,820 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 10:43:39,823 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 10:43:39,824 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:43:39" (1/1) ... [2025-03-03 10:43:39,826 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@178c604e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:43:39, skipping insertion in model container [2025-03-03 10:43:39,826 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:43:39" (1/1) ... [2025-03-03 10:43:39,906 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 10:43:40,095 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/eca-rers2012/Problem13_label37.c[7700,7713] [2025-03-03 10:43:40,567 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:43:40,578 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 10:43:40,597 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/eca-rers2012/Problem13_label37.c[7700,7713] [2025-03-03 10:43:40,878 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:43:40,895 INFO L204 MainTranslator]: Completed translation [2025-03-03 10:43:40,896 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:43:40 WrapperNode [2025-03-03 10:43:40,896 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 10:43:40,897 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 10:43:40,897 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 10:43:40,897 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 10:43:40,901 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:43:40" (1/1) ... [2025-03-03 10:43:40,960 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:43:40" (1/1) ... [2025-03-03 10:43:41,315 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5584 [2025-03-03 10:43:41,315 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 10:43:41,316 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 10:43:41,316 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 10:43:41,316 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 10:43:41,323 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:43:40" (1/1) ... [2025-03-03 10:43:41,324 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:43:40" (1/1) ... [2025-03-03 10:43:41,450 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:43:40" (1/1) ... [2025-03-03 10:43:41,608 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 10:43:41,608 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:43:40" (1/1) ... [2025-03-03 10:43:41,608 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:43:40" (1/1) ... [2025-03-03 10:43:41,709 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:43:40" (1/1) ... [2025-03-03 10:43:41,734 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:43:40" (1/1) ... [2025-03-03 10:43:41,760 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:43:40" (1/1) ... [2025-03-03 10:43:41,780 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:43:40" (1/1) ... [2025-03-03 10:43:41,835 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 10:43:41,836 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 10:43:41,836 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 10:43:41,837 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 10:43:41,837 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:43:40" (1/1) ... [2025-03-03 10:43:41,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:43:41,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:43:41,862 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 10:43:41,864 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 10:43:41,882 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 10:43:41,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 10:43:41,882 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 10:43:41,882 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 10:43:41,940 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 10:43:41,941 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 10:43:45,915 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1894: havoc calculate_output_#t~ret9#1; [2025-03-03 10:43:45,916 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3629: havoc calculate_output2_#t~ret10#1; [2025-03-03 10:43:45,916 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5351: havoc calculate_output3_#t~ret11#1; [2025-03-03 10:43:46,045 INFO L? ?]: Removed 738 outVars from TransFormulas that were not future-live. [2025-03-03 10:43:46,045 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 10:43:46,075 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 10:43:46,077 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 10:43:46,078 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:43:46 BoogieIcfgContainer [2025-03-03 10:43:46,078 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 10:43:46,080 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 10:43:46,080 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 10:43:46,085 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 10:43:46,085 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:43:39" (1/3) ... [2025-03-03 10:43:46,086 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f7661bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:43:46, skipping insertion in model container [2025-03-03 10:43:46,086 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:43:40" (2/3) ... [2025-03-03 10:43:46,086 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f7661bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:43:46, skipping insertion in model container [2025-03-03 10:43:46,086 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:43:46" (3/3) ... [2025-03-03 10:43:46,087 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem13_label37.c [2025-03-03 10:43:46,099 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 10:43:46,100 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem13_label37.c that has 1 procedures, 1098 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 10:43:46,171 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 10:43:46,181 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3aeef8af, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 10:43:46,181 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 10:43:46,187 INFO L276 IsEmpty]: Start isEmpty. Operand has 1098 states, 1096 states have (on average 1.8266423357664234) internal successors, (2002), 1097 states have internal predecessors, (2002), 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 10:43:46,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-03 10:43:46,193 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:43:46,193 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 10:43:46,193 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:43:46,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:43:46,198 INFO L85 PathProgramCache]: Analyzing trace with hash -523355690, now seen corresponding path program 1 times [2025-03-03 10:43:46,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:43:46,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468934468] [2025-03-03 10:43:46,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:43:46,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:43:46,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-03 10:43:46,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-03 10:43:46,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:43:46,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:43:46,518 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 10:43:46,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:43:46,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468934468] [2025-03-03 10:43:46,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468934468] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:43:46,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:43:46,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:43:46,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962478600] [2025-03-03 10:43:46,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:43:46,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:43:46,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:43:46,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:43:46,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:43:46,539 INFO L87 Difference]: Start difference. First operand has 1098 states, 1096 states have (on average 1.8266423357664234) internal successors, (2002), 1097 states have internal predecessors, (2002), 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 3 states, 3 states have (on average 18.0) internal successors, (54), 2 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 10:43:50,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:43:50,315 INFO L93 Difference]: Finished difference Result 3121 states and 5801 transitions. [2025-03-03 10:43:50,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:43:50,317 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 2 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 10:43:50,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:43:50,332 INFO L225 Difference]: With dead ends: 3121 [2025-03-03 10:43:50,332 INFO L226 Difference]: Without dead ends: 1944 [2025-03-03 10:43:50,338 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 10:43:50,341 INFO L435 NwaCegarLoop]: 434 mSDtfsCounter, 935 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 3124 mSolverCounterSat, 577 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 935 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 3701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 577 IncrementalHoareTripleChecker+Valid, 3124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:43:50,341 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [935 Valid, 571 Invalid, 3701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [577 Valid, 3124 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2025-03-03 10:43:50,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1944 states. [2025-03-03 10:43:50,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1944 to 1873. [2025-03-03 10:43:50,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1873 states, 1872 states have (on average 1.7393162393162394) internal successors, (3256), 1872 states have internal predecessors, (3256), 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 10:43:50,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1873 states to 1873 states and 3256 transitions. [2025-03-03 10:43:50,523 INFO L78 Accepts]: Start accepts. Automaton has 1873 states and 3256 transitions. Word has length 54 [2025-03-03 10:43:50,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:43:50,524 INFO L471 AbstractCegarLoop]: Abstraction has 1873 states and 3256 transitions. [2025-03-03 10:43:50,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 2 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 10:43:50,525 INFO L276 IsEmpty]: Start isEmpty. Operand 1873 states and 3256 transitions. [2025-03-03 10:43:50,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-03 10:43:50,528 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:43:50,528 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:43:50,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 10:43:50,529 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:43:50,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:43:50,529 INFO L85 PathProgramCache]: Analyzing trace with hash 524478063, now seen corresponding path program 1 times [2025-03-03 10:43:50,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:43:50,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687665913] [2025-03-03 10:43:50,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:43:50,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:43:50,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-03 10:43:50,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-03 10:43:50,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:43:50,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:43:50,883 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:43:50,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:43:50,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687665913] [2025-03-03 10:43:50,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687665913] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:43:50,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:43:50,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:43:50,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280534592] [2025-03-03 10:43:50,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:43:50,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:43:50,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:43:50,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:43:50,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:43:50,885 INFO L87 Difference]: Start difference. First operand 1873 states and 3256 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 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 10:43:53,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:43:53,653 INFO L93 Difference]: Finished difference Result 4604 states and 7964 transitions. [2025-03-03 10:43:53,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:43:53,653 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 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 119 [2025-03-03 10:43:53,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:43:53,662 INFO L225 Difference]: With dead ends: 4604 [2025-03-03 10:43:53,663 INFO L226 Difference]: Without dead ends: 2733 [2025-03-03 10:43:53,665 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 10:43:53,666 INFO L435 NwaCegarLoop]: 602 mSDtfsCounter, 815 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 3016 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 815 SdHoareTripleChecker+Valid, 738 SdHoareTripleChecker+Invalid, 3180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 3016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-03 10:43:53,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [815 Valid, 738 Invalid, 3180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 3016 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-03 10:43:53,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2733 states. [2025-03-03 10:43:53,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2733 to 2670. [2025-03-03 10:43:53,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2670 states, 2669 states have (on average 1.6579243162233046) internal successors, (4425), 2669 states have internal predecessors, (4425), 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 10:43:53,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2670 states to 2670 states and 4425 transitions. [2025-03-03 10:43:53,711 INFO L78 Accepts]: Start accepts. Automaton has 2670 states and 4425 transitions. Word has length 119 [2025-03-03 10:43:53,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:43:53,712 INFO L471 AbstractCegarLoop]: Abstraction has 2670 states and 4425 transitions. [2025-03-03 10:43:53,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 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 10:43:53,713 INFO L276 IsEmpty]: Start isEmpty. Operand 2670 states and 4425 transitions. [2025-03-03 10:43:53,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-03 10:43:53,716 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:43:53,716 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:43:53,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 10:43:53,716 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:43:53,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:43:53,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1888003715, now seen corresponding path program 1 times [2025-03-03 10:43:53,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:43:53,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184752563] [2025-03-03 10:43:53,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:43:53,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:43:53,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-03 10:43:53,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-03 10:43:53,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:43:53,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:43:53,846 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:43:53,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:43:53,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184752563] [2025-03-03 10:43:53,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184752563] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:43:53,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:43:53,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:43:53,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116598831] [2025-03-03 10:43:53,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:43:53,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:43:53,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:43:53,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:43:53,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:43:53,848 INFO L87 Difference]: Start difference. First operand 2670 states and 4425 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 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 10:43:56,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:43:56,394 INFO L93 Difference]: Finished difference Result 7732 states and 12864 transitions. [2025-03-03 10:43:56,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:43:56,394 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 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 120 [2025-03-03 10:43:56,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:43:56,410 INFO L225 Difference]: With dead ends: 7732 [2025-03-03 10:43:56,410 INFO L226 Difference]: Without dead ends: 5064 [2025-03-03 10:43:56,413 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 10:43:56,416 INFO L435 NwaCegarLoop]: 983 mSDtfsCounter, 870 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 2379 mSolverCounterSat, 876 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 870 SdHoareTripleChecker+Valid, 1136 SdHoareTripleChecker+Invalid, 3255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 876 IncrementalHoareTripleChecker+Valid, 2379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:43:56,416 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [870 Valid, 1136 Invalid, 3255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [876 Valid, 2379 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-03 10:43:56,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5064 states. [2025-03-03 10:43:56,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5064 to 5063. [2025-03-03 10:43:56,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5063 states, 5062 states have (on average 1.454563413670486) internal successors, (7363), 5062 states have internal predecessors, (7363), 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 10:43:56,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5063 states to 5063 states and 7363 transitions. [2025-03-03 10:43:56,479 INFO L78 Accepts]: Start accepts. Automaton has 5063 states and 7363 transitions. Word has length 120 [2025-03-03 10:43:56,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:43:56,480 INFO L471 AbstractCegarLoop]: Abstraction has 5063 states and 7363 transitions. [2025-03-03 10:43:56,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 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 10:43:56,481 INFO L276 IsEmpty]: Start isEmpty. Operand 5063 states and 7363 transitions. [2025-03-03 10:43:56,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-03 10:43:56,484 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:43:56,484 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:43:56,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 10:43:56,484 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:43:56,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:43:56,485 INFO L85 PathProgramCache]: Analyzing trace with hash 448274661, now seen corresponding path program 1 times [2025-03-03 10:43:56,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:43:56,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426965657] [2025-03-03 10:43:56,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:43:56,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:43:56,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-03 10:43:56,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-03 10:43:56,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:43:56,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:43:56,592 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:43:56,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:43:56,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426965657] [2025-03-03 10:43:56,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426965657] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:43:56,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:43:56,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:43:56,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209586188] [2025-03-03 10:43:56,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:43:56,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:43:56,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:43:56,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:43:56,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:43:56,595 INFO L87 Difference]: Start difference. First operand 5063 states and 7363 transitions. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 2 states have internal predecessors, (123), 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 10:43:59,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:43:59,469 INFO L93 Difference]: Finished difference Result 12513 states and 18431 transitions. [2025-03-03 10:43:59,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:43:59,470 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 2 states have internal predecessors, (123), 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 123 [2025-03-03 10:43:59,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:43:59,489 INFO L225 Difference]: With dead ends: 12513 [2025-03-03 10:43:59,489 INFO L226 Difference]: Without dead ends: 7452 [2025-03-03 10:43:59,493 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 10:43:59,495 INFO L435 NwaCegarLoop]: 1042 mSDtfsCounter, 871 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 2661 mSolverCounterSat, 719 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 871 SdHoareTripleChecker+Valid, 1175 SdHoareTripleChecker+Invalid, 3380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 719 IncrementalHoareTripleChecker+Valid, 2661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-03 10:43:59,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [871 Valid, 1175 Invalid, 3380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [719 Valid, 2661 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-03 10:43:59,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7452 states. [2025-03-03 10:43:59,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7452 to 7444. [2025-03-03 10:43:59,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7444 states, 7443 states have (on average 1.336826548434771) internal successors, (9950), 7443 states have internal predecessors, (9950), 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 10:43:59,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7444 states to 7444 states and 9950 transitions. [2025-03-03 10:43:59,623 INFO L78 Accepts]: Start accepts. Automaton has 7444 states and 9950 transitions. Word has length 123 [2025-03-03 10:43:59,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:43:59,624 INFO L471 AbstractCegarLoop]: Abstraction has 7444 states and 9950 transitions. [2025-03-03 10:43:59,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 2 states have internal predecessors, (123), 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 10:43:59,625 INFO L276 IsEmpty]: Start isEmpty. Operand 7444 states and 9950 transitions. [2025-03-03 10:43:59,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-03 10:43:59,627 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:43:59,627 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:43:59,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 10:43:59,627 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:43:59,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:43:59,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1972395911, now seen corresponding path program 1 times [2025-03-03 10:43:59,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:43:59,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881496173] [2025-03-03 10:43:59,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:43:59,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:43:59,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-03 10:43:59,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-03 10:43:59,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:43:59,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:43:59,750 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:43:59,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:43:59,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881496173] [2025-03-03 10:43:59,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881496173] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:43:59,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:43:59,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:43:59,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760825422] [2025-03-03 10:43:59,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:43:59,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:43:59,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:43:59,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:43:59,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:43:59,751 INFO L87 Difference]: Start difference. First operand 7444 states and 9950 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 2 states have internal predecessors, (127), 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 10:44:02,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:44:02,336 INFO L93 Difference]: Finished difference Result 20424 states and 27781 transitions. [2025-03-03 10:44:02,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:44:02,336 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 2 states have internal predecessors, (127), 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 127 [2025-03-03 10:44:02,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:44:02,365 INFO L225 Difference]: With dead ends: 20424 [2025-03-03 10:44:02,365 INFO L226 Difference]: Without dead ends: 13769 [2025-03-03 10:44:02,373 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 10:44:02,374 INFO L435 NwaCegarLoop]: 1010 mSDtfsCounter, 805 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 2489 mSolverCounterSat, 784 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 805 SdHoareTripleChecker+Valid, 1161 SdHoareTripleChecker+Invalid, 3273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 784 IncrementalHoareTripleChecker+Valid, 2489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:44:02,374 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [805 Valid, 1161 Invalid, 3273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [784 Valid, 2489 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-03 10:44:02,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13769 states. [2025-03-03 10:44:02,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13769 to 12962. [2025-03-03 10:44:02,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12962 states, 12961 states have (on average 1.2383303757426125) internal successors, (16050), 12961 states have internal predecessors, (16050), 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 10:44:02,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12962 states to 12962 states and 16050 transitions. [2025-03-03 10:44:02,536 INFO L78 Accepts]: Start accepts. Automaton has 12962 states and 16050 transitions. Word has length 127 [2025-03-03 10:44:02,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:44:02,536 INFO L471 AbstractCegarLoop]: Abstraction has 12962 states and 16050 transitions. [2025-03-03 10:44:02,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 2 states have internal predecessors, (127), 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 10:44:02,537 INFO L276 IsEmpty]: Start isEmpty. Operand 12962 states and 16050 transitions. [2025-03-03 10:44:02,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-03 10:44:02,538 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:44:02,538 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:44:02,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 10:44:02,538 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:44:02,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:44:02,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1401240883, now seen corresponding path program 1 times [2025-03-03 10:44:02,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:44:02,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802867770] [2025-03-03 10:44:02,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:44:02,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:44:02,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-03 10:44:02,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-03 10:44:02,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:44:02,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:44:02,739 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:44:02,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:44:02,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802867770] [2025-03-03 10:44:02,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802867770] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:44:02,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:44:02,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:44:02,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048244393] [2025-03-03 10:44:02,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:44:02,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:44:02,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:44:02,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:44:02,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:44:02,745 INFO L87 Difference]: Start difference. First operand 12962 states and 16050 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 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 10:44:04,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:44:04,846 INFO L93 Difference]: Finished difference Result 25135 states and 31301 transitions. [2025-03-03 10:44:04,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:44:04,847 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 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 143 [2025-03-03 10:44:04,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:44:04,865 INFO L225 Difference]: With dead ends: 25135 [2025-03-03 10:44:04,865 INFO L226 Difference]: Without dead ends: 12962 [2025-03-03 10:44:04,874 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 10:44:04,875 INFO L435 NwaCegarLoop]: 1083 mSDtfsCounter, 700 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 2520 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 1212 SdHoareTripleChecker+Invalid, 2524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:44:04,875 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [700 Valid, 1212 Invalid, 2524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2520 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-03 10:44:04,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12962 states. [2025-03-03 10:44:04,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12962 to 12962. [2025-03-03 10:44:04,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12962 states, 12961 states have (on average 1.2379446030398888) internal successors, (16045), 12961 states have internal predecessors, (16045), 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 10:44:04,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12962 states to 12962 states and 16045 transitions. [2025-03-03 10:44:04,998 INFO L78 Accepts]: Start accepts. Automaton has 12962 states and 16045 transitions. Word has length 143 [2025-03-03 10:44:04,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:44:04,999 INFO L471 AbstractCegarLoop]: Abstraction has 12962 states and 16045 transitions. [2025-03-03 10:44:05,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 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 10:44:05,000 INFO L276 IsEmpty]: Start isEmpty. Operand 12962 states and 16045 transitions. [2025-03-03 10:44:05,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-03 10:44:05,001 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:44:05,001 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:44:05,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 10:44:05,002 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:44:05,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:44:05,002 INFO L85 PathProgramCache]: Analyzing trace with hash -673657015, now seen corresponding path program 1 times [2025-03-03 10:44:05,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:44:05,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839797381] [2025-03-03 10:44:05,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:44:05,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:44:05,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-03 10:44:05,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-03 10:44:05,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:44:05,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:44:05,086 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:44:05,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:44:05,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839797381] [2025-03-03 10:44:05,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839797381] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:44:05,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:44:05,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:44:05,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460056206] [2025-03-03 10:44:05,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:44:05,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:44:05,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:44:05,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:44:05,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:44:05,089 INFO L87 Difference]: Start difference. First operand 12962 states and 16045 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 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 10:44:07,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:44:07,791 INFO L93 Difference]: Finished difference Result 31448 states and 39970 transitions. [2025-03-03 10:44:07,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:44:07,791 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 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 150 [2025-03-03 10:44:07,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:44:07,820 INFO L225 Difference]: With dead ends: 31448 [2025-03-03 10:44:07,820 INFO L226 Difference]: Without dead ends: 19275 [2025-03-03 10:44:07,826 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 10:44:07,826 INFO L435 NwaCegarLoop]: 837 mSDtfsCounter, 909 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 2391 mSolverCounterSat, 908 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 909 SdHoareTripleChecker+Valid, 957 SdHoareTripleChecker+Invalid, 3299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 908 IncrementalHoareTripleChecker+Valid, 2391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:44:07,827 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [909 Valid, 957 Invalid, 3299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [908 Valid, 2391 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-03 10:44:07,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19275 states. [2025-03-03 10:44:07,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19275 to 18478. [2025-03-03 10:44:07,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18478 states, 18477 states have (on average 1.2248200465443524) internal successors, (22631), 18477 states have internal predecessors, (22631), 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 10:44:07,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18478 states to 18478 states and 22631 transitions. [2025-03-03 10:44:07,986 INFO L78 Accepts]: Start accepts. Automaton has 18478 states and 22631 transitions. Word has length 150 [2025-03-03 10:44:07,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:44:07,986 INFO L471 AbstractCegarLoop]: Abstraction has 18478 states and 22631 transitions. [2025-03-03 10:44:07,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 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 10:44:07,987 INFO L276 IsEmpty]: Start isEmpty. Operand 18478 states and 22631 transitions. [2025-03-03 10:44:07,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2025-03-03 10:44:07,990 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:44:07,990 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:44:07,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 10:44:07,991 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:44:07,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:44:07,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1970027706, now seen corresponding path program 1 times [2025-03-03 10:44:07,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:44:07,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835881494] [2025-03-03 10:44:07,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:44:07,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:44:08,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 239 statements into 1 equivalence classes. [2025-03-03 10:44:08,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 239 of 239 statements. [2025-03-03 10:44:08,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:44:08,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:44:08,117 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2025-03-03 10:44:08,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:44:08,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835881494] [2025-03-03 10:44:08,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835881494] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:44:08,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:44:08,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:44:08,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100835123] [2025-03-03 10:44:08,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:44:08,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:44:08,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:44:08,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:44:08,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:44:08,119 INFO L87 Difference]: Start difference. First operand 18478 states and 22631 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 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 10:44:10,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:44:10,537 INFO L93 Difference]: Finished difference Result 42487 states and 53153 transitions. [2025-03-03 10:44:10,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:44:10,537 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 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 239 [2025-03-03 10:44:10,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:44:10,570 INFO L225 Difference]: With dead ends: 42487 [2025-03-03 10:44:10,571 INFO L226 Difference]: Without dead ends: 24798 [2025-03-03 10:44:10,588 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 10:44:10,589 INFO L435 NwaCegarLoop]: 705 mSDtfsCounter, 996 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 2389 mSolverCounterSat, 1023 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 996 SdHoareTripleChecker+Valid, 796 SdHoareTripleChecker+Invalid, 3412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1023 IncrementalHoareTripleChecker+Valid, 2389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:44:10,589 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [996 Valid, 796 Invalid, 3412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1023 Valid, 2389 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-03 10:44:10,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24798 states. [2025-03-03 10:44:10,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24798 to 24786. [2025-03-03 10:44:10,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24786 states, 24785 states have (on average 1.230260238047206) internal successors, (30492), 24785 states have internal predecessors, (30492), 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 10:44:10,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24786 states to 24786 states and 30492 transitions. [2025-03-03 10:44:10,918 INFO L78 Accepts]: Start accepts. Automaton has 24786 states and 30492 transitions. Word has length 239 [2025-03-03 10:44:10,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:44:10,919 INFO L471 AbstractCegarLoop]: Abstraction has 24786 states and 30492 transitions. [2025-03-03 10:44:10,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 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 10:44:10,919 INFO L276 IsEmpty]: Start isEmpty. Operand 24786 states and 30492 transitions. [2025-03-03 10:44:10,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2025-03-03 10:44:10,926 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:44:10,926 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 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 10:44:10,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 10:44:10,927 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:44:10,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:44:10,928 INFO L85 PathProgramCache]: Analyzing trace with hash 898505358, now seen corresponding path program 1 times [2025-03-03 10:44:10,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:44:10,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871626806] [2025-03-03 10:44:10,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:44:10,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:44:10,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 316 statements into 1 equivalence classes. [2025-03-03 10:44:10,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 316 of 316 statements. [2025-03-03 10:44:10,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:44:10,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:44:11,166 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 198 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:44:11,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:44:11,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871626806] [2025-03-03 10:44:11,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871626806] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:44:11,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:44:11,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:44:11,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741447206] [2025-03-03 10:44:11,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:44:11,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:44:11,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:44:11,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:44:11,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:44:11,168 INFO L87 Difference]: Start difference. First operand 24786 states and 30492 transitions. Second operand has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 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 10:44:13,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:44:13,406 INFO L93 Difference]: Finished difference Result 49597 states and 61040 transitions. [2025-03-03 10:44:13,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:44:13,406 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 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 316 [2025-03-03 10:44:13,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:44:13,435 INFO L225 Difference]: With dead ends: 49597 [2025-03-03 10:44:13,435 INFO L226 Difference]: Without dead ends: 25600 [2025-03-03 10:44:13,452 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 10:44:13,452 INFO L435 NwaCegarLoop]: 1799 mSDtfsCounter, 722 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 2560 mSolverCounterSat, 308 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 722 SdHoareTripleChecker+Valid, 1942 SdHoareTripleChecker+Invalid, 2868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 308 IncrementalHoareTripleChecker+Valid, 2560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-03 10:44:13,453 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [722 Valid, 1942 Invalid, 2868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [308 Valid, 2560 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-03 10:44:13,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25600 states. [2025-03-03 10:44:13,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25600 to 25574. [2025-03-03 10:44:13,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25574 states, 25573 states have (on average 1.2079145974269738) internal successors, (30890), 25573 states have internal predecessors, (30890), 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 10:44:13,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25574 states to 25574 states and 30890 transitions. [2025-03-03 10:44:13,737 INFO L78 Accepts]: Start accepts. Automaton has 25574 states and 30890 transitions. Word has length 316 [2025-03-03 10:44:13,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:44:13,738 INFO L471 AbstractCegarLoop]: Abstraction has 25574 states and 30890 transitions. [2025-03-03 10:44:13,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 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 10:44:13,738 INFO L276 IsEmpty]: Start isEmpty. Operand 25574 states and 30890 transitions. [2025-03-03 10:44:13,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2025-03-03 10:44:13,742 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:44:13,743 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:44:13,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 10:44:13,743 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:44:13,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:44:13,746 INFO L85 PathProgramCache]: Analyzing trace with hash 560685410, now seen corresponding path program 1 times [2025-03-03 10:44:13,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:44:13,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386688022] [2025-03-03 10:44:13,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:44:13,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:44:13,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 342 statements into 1 equivalence classes. [2025-03-03 10:44:13,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 342 of 342 statements. [2025-03-03 10:44:13,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:44:13,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:44:13,971 INFO L134 CoverageAnalysis]: Checked inductivity of 431 backedges. 379 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-03-03 10:44:13,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:44:13,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386688022] [2025-03-03 10:44:13,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386688022] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:44:13,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:44:13,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:44:13,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254473522] [2025-03-03 10:44:13,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:44:13,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:44:13,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:44:13,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:44:13,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:44:13,973 INFO L87 Difference]: Start difference. First operand 25574 states and 30890 transitions. Second operand has 4 states, 4 states have (on average 72.75) internal successors, (291), 3 states have internal predecessors, (291), 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 10:44:19,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:44:19,117 INFO L93 Difference]: Finished difference Result 75756 states and 92428 transitions. [2025-03-03 10:44:19,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:44:19,118 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 72.75) internal successors, (291), 3 states have internal predecessors, (291), 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 342 [2025-03-03 10:44:19,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:44:19,171 INFO L225 Difference]: With dead ends: 75756 [2025-03-03 10:44:19,171 INFO L226 Difference]: Without dead ends: 50971 [2025-03-03 10:44:19,186 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:44:19,187 INFO L435 NwaCegarLoop]: 886 mSDtfsCounter, 1708 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 7203 mSolverCounterSat, 981 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1708 SdHoareTripleChecker+Valid, 1154 SdHoareTripleChecker+Invalid, 8184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 981 IncrementalHoareTripleChecker+Valid, 7203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2025-03-03 10:44:19,187 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1708 Valid, 1154 Invalid, 8184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [981 Valid, 7203 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2025-03-03 10:44:19,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50971 states. [2025-03-03 10:44:19,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50971 to 50847. [2025-03-03 10:44:19,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50847 states, 50846 states have (on average 1.1909098060811076) internal successors, (60553), 50846 states have internal predecessors, (60553), 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 10:44:19,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50847 states to 50847 states and 60553 transitions. [2025-03-03 10:44:19,597 INFO L78 Accepts]: Start accepts. Automaton has 50847 states and 60553 transitions. Word has length 342 [2025-03-03 10:44:19,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:44:19,597 INFO L471 AbstractCegarLoop]: Abstraction has 50847 states and 60553 transitions. [2025-03-03 10:44:19,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 72.75) internal successors, (291), 3 states have internal predecessors, (291), 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 10:44:19,597 INFO L276 IsEmpty]: Start isEmpty. Operand 50847 states and 60553 transitions. [2025-03-03 10:44:19,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2025-03-03 10:44:19,600 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:44:19,601 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:44:19,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 10:44:19,601 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:44:19,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:44:19,601 INFO L85 PathProgramCache]: Analyzing trace with hash 571000431, now seen corresponding path program 1 times [2025-03-03 10:44:19,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:44:19,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363412968] [2025-03-03 10:44:19,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:44:19,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:44:19,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 345 statements into 1 equivalence classes. [2025-03-03 10:44:19,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 345 of 345 statements. [2025-03-03 10:44:19,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:44:19,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:44:19,984 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 227 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:44:19,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:44:19,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363412968] [2025-03-03 10:44:19,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363412968] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:44:19,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:44:19,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:44:19,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708038409] [2025-03-03 10:44:19,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:44:19,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:44:19,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:44:19,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:44:19,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:44:19,988 INFO L87 Difference]: Start difference. First operand 50847 states and 60553 transitions. Second operand has 4 states, 4 states have (on average 86.25) internal successors, (345), 3 states have internal predecessors, (345), 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 10:44:23,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:44:23,448 INFO L93 Difference]: Finished difference Result 122943 states and 144330 transitions. [2025-03-03 10:44:23,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:44:23,448 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 86.25) internal successors, (345), 3 states have internal predecessors, (345), 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 345 [2025-03-03 10:44:23,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:44:23,525 INFO L225 Difference]: With dead ends: 122943 [2025-03-03 10:44:23,525 INFO L226 Difference]: Without dead ends: 61861 [2025-03-03 10:44:23,566 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:44:23,566 INFO L435 NwaCegarLoop]: 946 mSDtfsCounter, 1469 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 4299 mSolverCounterSat, 779 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1469 SdHoareTripleChecker+Valid, 1163 SdHoareTripleChecker+Invalid, 5078 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 779 IncrementalHoareTripleChecker+Valid, 4299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-03-03 10:44:23,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1469 Valid, 1163 Invalid, 5078 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [779 Valid, 4299 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-03-03 10:44:23,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61861 states. [2025-03-03 10:44:24,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61861 to 61072. [2025-03-03 10:44:24,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61072 states, 61071 states have (on average 1.151332056131388) internal successors, (70313), 61071 states have internal predecessors, (70313), 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 10:44:24,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61072 states to 61072 states and 70313 transitions. [2025-03-03 10:44:24,153 INFO L78 Accepts]: Start accepts. Automaton has 61072 states and 70313 transitions. Word has length 345 [2025-03-03 10:44:24,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:44:24,153 INFO L471 AbstractCegarLoop]: Abstraction has 61072 states and 70313 transitions. [2025-03-03 10:44:24,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 86.25) internal successors, (345), 3 states have internal predecessors, (345), 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 10:44:24,153 INFO L276 IsEmpty]: Start isEmpty. Operand 61072 states and 70313 transitions. [2025-03-03 10:44:24,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2025-03-03 10:44:24,156 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:44:24,156 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-03 10:44:24,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 10:44:24,156 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:44:24,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:44:24,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1644040571, now seen corresponding path program 1 times [2025-03-03 10:44:24,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:44:24,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669143206] [2025-03-03 10:44:24,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:44:24,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:44:24,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 370 statements into 1 equivalence classes. [2025-03-03 10:44:24,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 370 of 370 statements. [2025-03-03 10:44:24,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:44:24,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:44:24,310 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2025-03-03 10:44:24,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:44:24,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669143206] [2025-03-03 10:44:24,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669143206] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:44:24,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:44:24,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:44:24,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353100074] [2025-03-03 10:44:24,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:44:24,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:44:24,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:44:24,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:44:24,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:44:24,311 INFO L87 Difference]: Start difference. First operand 61072 states and 70313 transitions. Second operand has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 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 10:44:26,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:44:26,955 INFO L93 Difference]: Finished difference Result 132357 states and 154299 transitions. [2025-03-03 10:44:26,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:44:26,956 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 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 370 [2025-03-03 10:44:26,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:44:27,031 INFO L225 Difference]: With dead ends: 132357 [2025-03-03 10:44:27,032 INFO L226 Difference]: Without dead ends: 72074 [2025-03-03 10:44:27,046 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 10:44:27,046 INFO L435 NwaCegarLoop]: 1429 mSDtfsCounter, 1112 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 2290 mSolverCounterSat, 737 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1112 SdHoareTripleChecker+Valid, 1517 SdHoareTripleChecker+Invalid, 3027 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 737 IncrementalHoareTripleChecker+Valid, 2290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:44:27,046 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1112 Valid, 1517 Invalid, 3027 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [737 Valid, 2290 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-03 10:44:27,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72074 states. [2025-03-03 10:44:27,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72074 to 72073. [2025-03-03 10:44:27,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72073 states, 72072 states have (on average 1.1341991341991342) internal successors, (81744), 72072 states have internal predecessors, (81744), 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 10:44:27,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72073 states to 72073 states and 81744 transitions. [2025-03-03 10:44:27,580 INFO L78 Accepts]: Start accepts. Automaton has 72073 states and 81744 transitions. Word has length 370 [2025-03-03 10:44:27,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:44:27,580 INFO L471 AbstractCegarLoop]: Abstraction has 72073 states and 81744 transitions. [2025-03-03 10:44:27,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 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 10:44:27,580 INFO L276 IsEmpty]: Start isEmpty. Operand 72073 states and 81744 transitions. [2025-03-03 10:44:27,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2025-03-03 10:44:27,583 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:44:27,584 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1] [2025-03-03 10:44:27,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 10:44:27,584 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:44:27,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:44:27,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1771625279, now seen corresponding path program 1 times [2025-03-03 10:44:27,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:44:27,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648471992] [2025-03-03 10:44:27,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:44:27,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:44:27,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 405 statements into 1 equivalence classes. [2025-03-03 10:44:27,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 405 of 405 statements. [2025-03-03 10:44:27,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:44:27,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:44:27,927 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 339 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2025-03-03 10:44:27,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:44:27,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648471992] [2025-03-03 10:44:27,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648471992] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:44:27,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:44:27,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:44:27,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644782369] [2025-03-03 10:44:27,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:44:27,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:44:27,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:44:27,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:44:27,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:44:27,929 INFO L87 Difference]: Start difference. First operand 72073 states and 81744 transitions. Second operand has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 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 10:44:30,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:44:30,478 INFO L93 Difference]: Finished difference Result 143377 states and 162728 transitions. [2025-03-03 10:44:30,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:44:30,478 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 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 405 [2025-03-03 10:44:30,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:44:30,561 INFO L225 Difference]: With dead ends: 143377 [2025-03-03 10:44:30,562 INFO L226 Difference]: Without dead ends: 72093 [2025-03-03 10:44:30,606 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 10:44:30,606 INFO L435 NwaCegarLoop]: 1727 mSDtfsCounter, 706 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 2493 mSolverCounterSat, 385 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 706 SdHoareTripleChecker+Valid, 1870 SdHoareTripleChecker+Invalid, 2878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 385 IncrementalHoareTripleChecker+Valid, 2493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-03 10:44:30,606 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [706 Valid, 1870 Invalid, 2878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [385 Valid, 2493 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-03 10:44:30,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72093 states. [2025-03-03 10:44:31,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72093 to 72071. [2025-03-03 10:44:31,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72071 states, 72070 states have (on average 1.108491744137644) internal successors, (79889), 72070 states have internal predecessors, (79889), 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 10:44:31,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72071 states to 72071 states and 79889 transitions. [2025-03-03 10:44:31,394 INFO L78 Accepts]: Start accepts. Automaton has 72071 states and 79889 transitions. Word has length 405 [2025-03-03 10:44:31,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:44:31,394 INFO L471 AbstractCegarLoop]: Abstraction has 72071 states and 79889 transitions. [2025-03-03 10:44:31,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 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 10:44:31,394 INFO L276 IsEmpty]: Start isEmpty. Operand 72071 states and 79889 transitions. [2025-03-03 10:44:31,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 501 [2025-03-03 10:44:31,404 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:44:31,404 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:44:31,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 10:44:31,404 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:44:31,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:44:31,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1857441275, now seen corresponding path program 1 times [2025-03-03 10:44:31,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:44:31,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170798887] [2025-03-03 10:44:31,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:44:31,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:44:31,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 500 statements into 1 equivalence classes. [2025-03-03 10:44:31,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 500 of 500 statements. [2025-03-03 10:44:31,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:44:31,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:44:31,733 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2025-03-03 10:44:31,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:44:31,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170798887] [2025-03-03 10:44:31,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170798887] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:44:31,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:44:31,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:44:31,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417406928] [2025-03-03 10:44:31,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:44:31,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:44:31,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:44:31,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:44:31,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:44:31,734 INFO L87 Difference]: Start difference. First operand 72071 states and 79889 transitions. Second operand has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 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 10:44:34,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:44:34,493 INFO L93 Difference]: Finished difference Result 157511 states and 175916 transitions. [2025-03-03 10:44:34,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:44:34,493 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 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 500 [2025-03-03 10:44:34,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:44:34,582 INFO L225 Difference]: With dead ends: 157511 [2025-03-03 10:44:34,582 INFO L226 Difference]: Without dead ends: 86229 [2025-03-03 10:44:34,621 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 10:44:34,621 INFO L435 NwaCegarLoop]: 1620 mSDtfsCounter, 817 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 2409 mSolverCounterSat, 644 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 817 SdHoareTripleChecker+Valid, 1761 SdHoareTripleChecker+Invalid, 3053 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 644 IncrementalHoareTripleChecker+Valid, 2409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-03 10:44:34,621 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [817 Valid, 1761 Invalid, 3053 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [644 Valid, 2409 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-03 10:44:34,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86229 states. [2025-03-03 10:44:35,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86229 to 86212. [2025-03-03 10:44:35,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86212 states, 86211 states have (on average 1.0860679031678093) internal successors, (93631), 86211 states have internal predecessors, (93631), 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 10:44:35,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86212 states to 86212 states and 93631 transitions. [2025-03-03 10:44:35,371 INFO L78 Accepts]: Start accepts. Automaton has 86212 states and 93631 transitions. Word has length 500 [2025-03-03 10:44:35,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:44:35,372 INFO L471 AbstractCegarLoop]: Abstraction has 86212 states and 93631 transitions. [2025-03-03 10:44:35,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 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 10:44:35,372 INFO L276 IsEmpty]: Start isEmpty. Operand 86212 states and 93631 transitions. [2025-03-03 10:44:35,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 537 [2025-03-03 10:44:35,379 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:44:35,379 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:44:35,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 10:44:35,379 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:44:35,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:44:35,380 INFO L85 PathProgramCache]: Analyzing trace with hash 587682753, now seen corresponding path program 1 times [2025-03-03 10:44:35,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:44:35,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581346625] [2025-03-03 10:44:35,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:44:35,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:44:35,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 536 statements into 1 equivalence classes. [2025-03-03 10:44:35,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 536 of 536 statements. [2025-03-03 10:44:35,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:44:35,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:44:35,866 INFO L134 CoverageAnalysis]: Checked inductivity of 792 backedges. 652 proven. 0 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2025-03-03 10:44:35,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:44:35,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581346625] [2025-03-03 10:44:35,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581346625] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:44:35,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:44:35,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 10:44:35,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206531131] [2025-03-03 10:44:35,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:44:35,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:44:35,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:44:35,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:44:35,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:44:35,868 INFO L87 Difference]: Start difference. First operand 86212 states and 93631 transitions. Second operand has 4 states, 4 states have (on average 99.5) internal successors, (398), 4 states have internal predecessors, (398), 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 10:44:40,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:44:40,979 INFO L93 Difference]: Finished difference Result 245067 states and 267108 transitions. [2025-03-03 10:44:40,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:44:40,979 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 99.5) internal successors, (398), 4 states have internal predecessors, (398), 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 536 [2025-03-03 10:44:40,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:44:41,159 INFO L225 Difference]: With dead ends: 245067 [2025-03-03 10:44:41,159 INFO L226 Difference]: Without dead ends: 159644 [2025-03-03 10:44:41,216 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:44:41,216 INFO L435 NwaCegarLoop]: 654 mSDtfsCounter, 1722 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 6319 mSolverCounterSat, 1035 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1722 SdHoareTripleChecker+Valid, 924 SdHoareTripleChecker+Invalid, 7354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1035 IncrementalHoareTripleChecker+Valid, 6319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:44:41,216 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1722 Valid, 924 Invalid, 7354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1035 Valid, 6319 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2025-03-03 10:44:41,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159644 states. [2025-03-03 10:44:42,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159644 to 131901. [2025-03-03 10:44:42,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131901 states, 131900 states have (on average 1.0807808946171342) internal successors, (142555), 131900 states have internal predecessors, (142555), 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 10:44:43,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131901 states to 131901 states and 142555 transitions. [2025-03-03 10:44:43,069 INFO L78 Accepts]: Start accepts. Automaton has 131901 states and 142555 transitions. Word has length 536 [2025-03-03 10:44:43,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:44:43,069 INFO L471 AbstractCegarLoop]: Abstraction has 131901 states and 142555 transitions. [2025-03-03 10:44:43,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 99.5) internal successors, (398), 4 states have internal predecessors, (398), 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 10:44:43,069 INFO L276 IsEmpty]: Start isEmpty. Operand 131901 states and 142555 transitions. [2025-03-03 10:44:43,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 548 [2025-03-03 10:44:43,077 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:44:43,077 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1] [2025-03-03 10:44:43,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 10:44:43,077 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:44:43,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:44:43,077 INFO L85 PathProgramCache]: Analyzing trace with hash -463541877, now seen corresponding path program 1 times [2025-03-03 10:44:43,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:44:43,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620231039] [2025-03-03 10:44:43,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:44:43,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:44:43,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 547 statements into 1 equivalence classes. [2025-03-03 10:44:43,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 547 of 547 statements. [2025-03-03 10:44:43,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:44:43,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:44:43,585 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 533 proven. 75 refuted. 0 times theorem prover too weak. 416 trivial. 0 not checked. [2025-03-03 10:44:43,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:44:43,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620231039] [2025-03-03 10:44:43,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620231039] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:44:43,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [206211299] [2025-03-03 10:44:43,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:44:43,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:44:43,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:44:43,589 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 10:44:43,590 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 10:44:43,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 547 statements into 1 equivalence classes. [2025-03-03 10:44:43,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 547 of 547 statements. [2025-03-03 10:44:43,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:44:43,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:44:43,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 734 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:44:43,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:44:44,031 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 533 proven. 0 refuted. 0 times theorem prover too weak. 491 trivial. 0 not checked. [2025-03-03 10:44:44,032 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:44:44,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [206211299] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:44:44,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:44:44,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2025-03-03 10:44:44,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324907013] [2025-03-03 10:44:44,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:44:44,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:44:44,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:44:44,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:44:44,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:44:44,033 INFO L87 Difference]: Start difference. First operand 131901 states and 142555 transitions. Second operand has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 2 states have internal predecessors, (269), 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 10:44:46,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:44:46,884 INFO L93 Difference]: Finished difference Result 339535 states and 367613 transitions. [2025-03-03 10:44:46,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:44:46,884 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 2 states have internal predecessors, (269), 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 547 [2025-03-03 10:44:46,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:44:47,143 INFO L225 Difference]: With dead ends: 339535 [2025-03-03 10:44:47,143 INFO L226 Difference]: Without dead ends: 208423 [2025-03-03 10:44:47,437 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 549 GetRequests, 546 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:44:47,438 INFO L435 NwaCegarLoop]: 772 mSDtfsCounter, 1025 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 2547 mSolverCounterSat, 462 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1025 SdHoareTripleChecker+Valid, 965 SdHoareTripleChecker+Invalid, 3009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 462 IncrementalHoareTripleChecker+Valid, 2547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-03 10:44:47,438 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1025 Valid, 965 Invalid, 3009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [462 Valid, 2547 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-03 10:44:47,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208423 states. [2025-03-03 10:44:49,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208423 to 205236. [2025-03-03 10:44:49,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205236 states, 205235 states have (on average 1.0682144858333131) internal successors, (219235), 205235 states have internal predecessors, (219235), 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 10:44:49,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205236 states to 205236 states and 219235 transitions. [2025-03-03 10:44:49,489 INFO L78 Accepts]: Start accepts. Automaton has 205236 states and 219235 transitions. Word has length 547 [2025-03-03 10:44:49,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:44:49,489 INFO L471 AbstractCegarLoop]: Abstraction has 205236 states and 219235 transitions. [2025-03-03 10:44:49,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 2 states have internal predecessors, (269), 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 10:44:49,489 INFO L276 IsEmpty]: Start isEmpty. Operand 205236 states and 219235 transitions. [2025-03-03 10:44:49,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 610 [2025-03-03 10:44:49,499 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:44:49,500 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:44:49,506 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 10:44:49,700 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,SelfDestructingSolverStorable15 [2025-03-03 10:44:49,701 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:44:49,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:44:49,701 INFO L85 PathProgramCache]: Analyzing trace with hash -83479354, now seen corresponding path program 1 times [2025-03-03 10:44:49,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:44:49,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516681229] [2025-03-03 10:44:49,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:44:49,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:44:49,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 609 statements into 1 equivalence classes. [2025-03-03 10:44:49,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 609 of 609 statements. [2025-03-03 10:44:49,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:44:49,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:44:50,372 INFO L134 CoverageAnalysis]: Checked inductivity of 1135 backedges. 259 proven. 0 refuted. 0 times theorem prover too weak. 876 trivial. 0 not checked. [2025-03-03 10:44:50,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:44:50,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516681229] [2025-03-03 10:44:50,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516681229] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:44:50,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:44:50,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:44:50,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844631099] [2025-03-03 10:44:50,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:44:50,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:44:50,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:44:50,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:44:50,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:44:50,374 INFO L87 Difference]: Start difference. First operand 205236 states and 219235 transitions. Second operand has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 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 10:44:53,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:44:53,963 INFO L93 Difference]: Finished difference Result 494678 states and 528772 transitions. [2025-03-03 10:44:53,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:44:53,963 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 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 609 [2025-03-03 10:44:53,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:44:54,371 INFO L225 Difference]: With dead ends: 494678 [2025-03-03 10:44:54,372 INFO L226 Difference]: Without dead ends: 290231 [2025-03-03 10:44:54,490 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 10:44:54,491 INFO L435 NwaCegarLoop]: 460 mSDtfsCounter, 953 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 2528 mSolverCounterSat, 681 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 953 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 3209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 681 IncrementalHoareTripleChecker+Valid, 2528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:44:54,491 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [953 Valid, 564 Invalid, 3209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [681 Valid, 2528 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-03 10:44:54,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290231 states. [2025-03-03 10:44:56,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290231 to 248517. [2025-03-03 10:44:57,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248517 states, 248516 states have (on average 1.0671506059971994) internal successors, (265204), 248516 states have internal predecessors, (265204), 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 10:44:57,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248517 states to 248517 states and 265204 transitions. [2025-03-03 10:44:57,337 INFO L78 Accepts]: Start accepts. Automaton has 248517 states and 265204 transitions. Word has length 609 [2025-03-03 10:44:57,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:44:57,338 INFO L471 AbstractCegarLoop]: Abstraction has 248517 states and 265204 transitions. [2025-03-03 10:44:57,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 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 10:44:57,338 INFO L276 IsEmpty]: Start isEmpty. Operand 248517 states and 265204 transitions. [2025-03-03 10:44:57,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 963 [2025-03-03 10:44:57,399 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:44:57,399 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:44:57,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 10:44:57,400 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:44:57,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:44:57,400 INFO L85 PathProgramCache]: Analyzing trace with hash 98446104, now seen corresponding path program 1 times [2025-03-03 10:44:57,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:44:57,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009115857] [2025-03-03 10:44:57,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:44:57,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:44:57,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 962 statements into 1 equivalence classes. [2025-03-03 10:44:57,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 962 of 962 statements. [2025-03-03 10:44:57,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:44:57,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:44:58,458 INFO L134 CoverageAnalysis]: Checked inductivity of 2134 backedges. 1325 proven. 0 refuted. 0 times theorem prover too weak. 809 trivial. 0 not checked. [2025-03-03 10:44:58,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:44:58,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009115857] [2025-03-03 10:44:58,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009115857] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:44:58,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:44:58,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:44:58,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417296903] [2025-03-03 10:44:58,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:44:58,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:44:58,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:44:58,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:44:58,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:44:58,461 INFO L87 Difference]: Start difference. First operand 248517 states and 265204 transitions. Second operand has 3 states, 3 states have (on average 197.0) internal successors, (591), 3 states have internal predecessors, (591), 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 10:45:01,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:45:01,964 INFO L93 Difference]: Finished difference Result 493094 states and 526247 transitions. [2025-03-03 10:45:01,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:45:01,965 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 197.0) internal successors, (591), 3 states have internal predecessors, (591), 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 962 [2025-03-03 10:45:01,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:45:02,239 INFO L225 Difference]: With dead ends: 493094 [2025-03-03 10:45:02,239 INFO L226 Difference]: Without dead ends: 245366 [2025-03-03 10:45:02,275 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 10:45:02,276 INFO L435 NwaCegarLoop]: 1642 mSDtfsCounter, 556 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 2379 mSolverCounterSat, 553 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 556 SdHoareTripleChecker+Valid, 1780 SdHoareTripleChecker+Invalid, 2932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 553 IncrementalHoareTripleChecker+Valid, 2379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-03 10:45:02,276 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [556 Valid, 1780 Invalid, 2932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [553 Valid, 2379 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-03 10:45:02,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245366 states.