./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.7.1.ufo.UNBOUNDED.pals+Problem12_label09.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pals_lcr.7.1.ufo.UNBOUNDED.pals+Problem12_label09.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 c2b92f7b268935cb0637cec19294e5d3b9c96e09bf4c6f56efedf9d49b1a49f7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 20:33:57,050 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 20:33:57,120 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 20:33:57,123 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 20:33:57,124 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 20:33:57,138 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 20:33:57,139 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 20:33:57,139 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 20:33:57,139 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 20:33:57,139 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 20:33:57,139 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 20:33:57,139 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 20:33:57,140 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 20:33:57,140 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 20:33:57,140 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 20:33:57,140 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 20:33:57,140 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 20:33:57,140 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 20:33:57,140 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 20:33:57,140 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 20:33:57,140 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 20:33:57,141 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 20:33:57,141 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 20:33:57,141 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 20:33:57,141 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 20:33:57,141 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 20:33:57,141 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 20:33:57,141 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 20:33:57,141 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 20:33:57,141 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 20:33:57,141 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 20:33:57,141 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 20:33:57,142 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 20:33:57,142 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 20:33:57,142 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 20:33:57,142 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 20:33:57,142 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 20:33:57,142 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 20:33:57,142 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 20:33:57,142 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 20:33:57,142 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 20:33:57,142 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 20:33:57,142 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 20:33:57,143 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 -> c2b92f7b268935cb0637cec19294e5d3b9c96e09bf4c6f56efedf9d49b1a49f7 [2025-03-16 20:33:57,365 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 20:33:57,372 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 20:33:57,374 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 20:33:57,374 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 20:33:57,375 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 20:33:57,375 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.7.1.ufo.UNBOUNDED.pals+Problem12_label09.c [2025-03-16 20:33:58,484 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a06c3196/358a9cca017a42068789134c4d72fc69/FLAG416997022 [2025-03-16 20:33:58,988 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 20:33:58,990 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.7.1.ufo.UNBOUNDED.pals+Problem12_label09.c [2025-03-16 20:33:59,019 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a06c3196/358a9cca017a42068789134c4d72fc69/FLAG416997022 [2025-03-16 20:33:59,054 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a06c3196/358a9cca017a42068789134c4d72fc69 [2025-03-16 20:33:59,055 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 20:33:59,057 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 20:33:59,057 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 20:33:59,058 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 20:33:59,062 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 20:33:59,063 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 08:33:59" (1/1) ... [2025-03-16 20:33:59,063 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@207b3483 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:33:59, skipping insertion in model container [2025-03-16 20:33:59,064 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 08:33:59" (1/1) ... [2025-03-16 20:33:59,139 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 20:33:59,477 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.7.1.ufo.UNBOUNDED.pals+Problem12_label09.c[20491,20504] [2025-03-16 20:33:59,538 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.7.1.ufo.UNBOUNDED.pals+Problem12_label09.c[28239,28252] [2025-03-16 20:33:59,944 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 20:33:59,954 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 20:33:59,989 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.7.1.ufo.UNBOUNDED.pals+Problem12_label09.c[20491,20504] [2025-03-16 20:33:59,995 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.7.1.ufo.UNBOUNDED.pals+Problem12_label09.c[28239,28252] [2025-03-16 20:34:00,238 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 20:34:00,258 INFO L204 MainTranslator]: Completed translation [2025-03-16 20:34:00,259 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:34:00 WrapperNode [2025-03-16 20:34:00,259 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 20:34:00,260 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 20:34:00,260 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 20:34:00,260 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 20:34:00,265 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:34:00" (1/1) ... [2025-03-16 20:34:00,309 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:34:00" (1/1) ... [2025-03-16 20:34:00,555 INFO L138 Inliner]: procedures = 39, calls = 24, calls flagged for inlining = 19, calls inlined = 19, statements flattened = 5214 [2025-03-16 20:34:00,556 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 20:34:00,556 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 20:34:00,557 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 20:34:00,557 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 20:34:00,564 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:34:00" (1/1) ... [2025-03-16 20:34:00,564 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:34:00" (1/1) ... [2025-03-16 20:34:00,606 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:34:00" (1/1) ... [2025-03-16 20:34:00,783 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-16 20:34:00,783 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:34:00" (1/1) ... [2025-03-16 20:34:00,784 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:34:00" (1/1) ... [2025-03-16 20:34:00,930 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:34:00" (1/1) ... [2025-03-16 20:34:00,951 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:34:00" (1/1) ... [2025-03-16 20:34:00,972 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:34:00" (1/1) ... [2025-03-16 20:34:00,990 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:34:00" (1/1) ... [2025-03-16 20:34:01,036 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 20:34:01,038 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 20:34:01,039 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 20:34:01,039 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 20:34:01,040 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:34:00" (1/1) ... [2025-03-16 20:34:01,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 20:34:01,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:34:01,069 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-16 20:34:01,075 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-16 20:34:01,091 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 20:34:01,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 20:34:01,091 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 20:34:01,091 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 20:34:01,179 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 20:34:01,181 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 20:34:04,502 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5258: havoc calculate_output3_#t~ret47#1; [2025-03-16 20:34:04,503 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2289: havoc calculate_output_#t~ret45#1; [2025-03-16 20:34:04,503 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3768: havoc calculate_output2_#t~ret46#1; [2025-03-16 20:34:04,641 INFO L? ?]: Removed 750 outVars from TransFormulas that were not future-live. [2025-03-16 20:34:04,641 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 20:34:04,673 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 20:34:04,673 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 20:34:04,673 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:34:04 BoogieIcfgContainer [2025-03-16 20:34:04,674 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 20:34:04,676 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 20:34:04,676 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 20:34:04,680 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 20:34:04,680 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 08:33:59" (1/3) ... [2025-03-16 20:34:04,681 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@321f972c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 08:34:04, skipping insertion in model container [2025-03-16 20:34:04,681 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:34:00" (2/3) ... [2025-03-16 20:34:04,681 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@321f972c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 08:34:04, skipping insertion in model container [2025-03-16 20:34:04,681 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:34:04" (3/3) ... [2025-03-16 20:34:04,683 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.7.1.ufo.UNBOUNDED.pals+Problem12_label09.c [2025-03-16 20:34:04,692 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 20:34:04,695 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.7.1.ufo.UNBOUNDED.pals+Problem12_label09.c that has 1 procedures, 867 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-03-16 20:34:04,758 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 20:34:04,769 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;@bfd94a5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 20:34:04,770 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-16 20:34:04,775 INFO L276 IsEmpty]: Start isEmpty. Operand has 867 states, 864 states have (on average 1.96875) internal successors, (1701), 866 states have internal predecessors, (1701), 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-16 20:34:04,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-16 20:34:04,782 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:34:04,782 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] [2025-03-16 20:34:04,783 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:34:04,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:34:04,786 INFO L85 PathProgramCache]: Analyzing trace with hash 123168304, now seen corresponding path program 1 times [2025-03-16 20:34:04,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:34:04,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143979296] [2025-03-16 20:34:04,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:34:04,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:34:04,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-16 20:34:04,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-16 20:34:04,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:34:04,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:34:04,991 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-16 20:34:04,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:34:04,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143979296] [2025-03-16 20:34:04,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143979296] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:34:04,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:34:04,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 20:34:04,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451845962] [2025-03-16 20:34:04,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:34:04,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 20:34:04,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:34:05,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 20:34:05,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 20:34:05,015 INFO L87 Difference]: Start difference. First operand has 867 states, 864 states have (on average 1.96875) internal successors, (1701), 866 states have internal predecessors, (1701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 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-16 20:34:05,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:34:05,078 INFO L93 Difference]: Finished difference Result 1680 states and 3296 transitions. [2025-03-16 20:34:05,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 20:34:05,079 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 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 25 [2025-03-16 20:34:05,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:34:05,096 INFO L225 Difference]: With dead ends: 1680 [2025-03-16 20:34:05,096 INFO L226 Difference]: Without dead ends: 863 [2025-03-16 20:34:05,102 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 20:34:05,104 INFO L435 NwaCegarLoop]: 1636 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1636 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:34:05,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1636 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:34:05,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2025-03-16 20:34:05,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 863. [2025-03-16 20:34:05,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 863 states, 861 states have (on average 1.8954703832752613) internal successors, (1632), 862 states have internal predecessors, (1632), 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-16 20:34:05,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 863 states to 863 states and 1632 transitions. [2025-03-16 20:34:05,171 INFO L78 Accepts]: Start accepts. Automaton has 863 states and 1632 transitions. Word has length 25 [2025-03-16 20:34:05,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:34:05,171 INFO L471 AbstractCegarLoop]: Abstraction has 863 states and 1632 transitions. [2025-03-16 20:34:05,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 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-16 20:34:05,172 INFO L276 IsEmpty]: Start isEmpty. Operand 863 states and 1632 transitions. [2025-03-16 20:34:05,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-16 20:34:05,172 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:34:05,173 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] [2025-03-16 20:34:05,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 20:34:05,173 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:34:05,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:34:05,174 INFO L85 PathProgramCache]: Analyzing trace with hash 334519217, now seen corresponding path program 1 times [2025-03-16 20:34:05,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:34:05,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908335260] [2025-03-16 20:34:05,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:34:05,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:34:05,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-16 20:34:05,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-16 20:34:05,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:34:05,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:34:05,394 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-16 20:34:05,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:34:05,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908335260] [2025-03-16 20:34:05,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908335260] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:34:05,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:34:05,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 20:34:05,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877946214] [2025-03-16 20:34:05,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:34:05,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 20:34:05,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:34:05,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 20:34:05,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:34:05,398 INFO L87 Difference]: Start difference. First operand 863 states and 1632 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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-16 20:34:05,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:34:05,473 INFO L93 Difference]: Finished difference Result 921 states and 1724 transitions. [2025-03-16 20:34:05,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:34:05,474 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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 25 [2025-03-16 20:34:05,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:34:05,479 INFO L225 Difference]: With dead ends: 921 [2025-03-16 20:34:05,480 INFO L226 Difference]: Without dead ends: 863 [2025-03-16 20:34:05,480 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-16 20:34:05,481 INFO L435 NwaCegarLoop]: 1631 mSDtfsCounter, 0 mSDsluCounter, 3208 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4839 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:34:05,481 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4839 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:34:05,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2025-03-16 20:34:05,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 863. [2025-03-16 20:34:05,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 863 states, 861 states have (on average 1.8373983739837398) internal successors, (1582), 862 states have internal predecessors, (1582), 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-16 20:34:05,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 863 states to 863 states and 1582 transitions. [2025-03-16 20:34:05,514 INFO L78 Accepts]: Start accepts. Automaton has 863 states and 1582 transitions. Word has length 25 [2025-03-16 20:34:05,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:34:05,514 INFO L471 AbstractCegarLoop]: Abstraction has 863 states and 1582 transitions. [2025-03-16 20:34:05,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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-16 20:34:05,514 INFO L276 IsEmpty]: Start isEmpty. Operand 863 states and 1582 transitions. [2025-03-16 20:34:05,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-16 20:34:05,515 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:34:05,515 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:34:05,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 20:34:05,516 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:34:05,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:34:05,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1165899810, now seen corresponding path program 1 times [2025-03-16 20:34:05,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:34:05,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744900939] [2025-03-16 20:34:05,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:34:05,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:34:05,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-16 20:34:05,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-16 20:34:05,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:34:05,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:34:05,791 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-16 20:34:05,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:34:05,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744900939] [2025-03-16 20:34:05,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744900939] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:34:05,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:34:05,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:34:05,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67974760] [2025-03-16 20:34:05,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:34:05,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 20:34:05,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:34:05,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 20:34:05,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:34:05,794 INFO L87 Difference]: Start difference. First operand 863 states and 1582 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 3 states have internal predecessors, (66), 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-16 20:34:10,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:34:10,785 INFO L93 Difference]: Finished difference Result 3118 states and 5891 transitions. [2025-03-16 20:34:10,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:34:10,786 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 3 states have internal predecessors, (66), 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 66 [2025-03-16 20:34:10,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:34:10,796 INFO L225 Difference]: With dead ends: 3118 [2025-03-16 20:34:10,796 INFO L226 Difference]: Without dead ends: 2365 [2025-03-16 20:34:10,797 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:34:10,798 INFO L435 NwaCegarLoop]: 818 mSDtfsCounter, 2466 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 5354 mSolverCounterSat, 1153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2466 SdHoareTripleChecker+Valid, 836 SdHoareTripleChecker+Invalid, 6507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1153 IncrementalHoareTripleChecker+Valid, 5354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2025-03-16 20:34:10,799 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2466 Valid, 836 Invalid, 6507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1153 Valid, 5354 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2025-03-16 20:34:10,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2365 states. [2025-03-16 20:34:10,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2365 to 2365. [2025-03-16 20:34:10,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2365 states, 2363 states have (on average 1.5641134151502327) internal successors, (3696), 2364 states have internal predecessors, (3696), 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-16 20:34:10,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2365 states to 2365 states and 3696 transitions. [2025-03-16 20:34:10,857 INFO L78 Accepts]: Start accepts. Automaton has 2365 states and 3696 transitions. Word has length 66 [2025-03-16 20:34:10,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:34:10,857 INFO L471 AbstractCegarLoop]: Abstraction has 2365 states and 3696 transitions. [2025-03-16 20:34:10,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 3 states have internal predecessors, (66), 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-16 20:34:10,858 INFO L276 IsEmpty]: Start isEmpty. Operand 2365 states and 3696 transitions. [2025-03-16 20:34:10,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-16 20:34:10,862 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:34:10,862 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:34:10,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 20:34:10,862 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:34:10,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:34:10,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1938958589, now seen corresponding path program 1 times [2025-03-16 20:34:10,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:34:10,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960975424] [2025-03-16 20:34:10,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:34:10,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:34:10,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-16 20:34:10,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-16 20:34:10,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:34:10,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:34:11,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:34:11,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:34:11,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960975424] [2025-03-16 20:34:11,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960975424] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:34:11,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:34:11,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 20:34:11,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366273324] [2025-03-16 20:34:11,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:34:11,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 20:34:11,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:34:11,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 20:34:11,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:34:11,086 INFO L87 Difference]: Start difference. First operand 2365 states and 3696 transitions. Second operand has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 9 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:34:11,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:34:11,349 INFO L93 Difference]: Finished difference Result 3135 states and 4942 transitions. [2025-03-16 20:34:11,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-16 20:34:11,349 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 9 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2025-03-16 20:34:11,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:34:11,359 INFO L225 Difference]: With dead ends: 3135 [2025-03-16 20:34:11,359 INFO L226 Difference]: Without dead ends: 3080 [2025-03-16 20:34:11,361 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=124, Invalid=256, Unknown=0, NotChecked=0, Total=380 [2025-03-16 20:34:11,362 INFO L435 NwaCegarLoop]: 1576 mSDtfsCounter, 11584 mSDsluCounter, 2857 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11584 SdHoareTripleChecker+Valid, 4433 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:34:11,363 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11584 Valid, 4433 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:34:11,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3080 states. [2025-03-16 20:34:11,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3080 to 2418. [2025-03-16 20:34:11,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2418 states, 2416 states have (on average 1.5653973509933774) internal successors, (3782), 2417 states have internal predecessors, (3782), 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-16 20:34:11,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2418 states to 2418 states and 3782 transitions. [2025-03-16 20:34:11,412 INFO L78 Accepts]: Start accepts. Automaton has 2418 states and 3782 transitions. Word has length 74 [2025-03-16 20:34:11,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:34:11,413 INFO L471 AbstractCegarLoop]: Abstraction has 2418 states and 3782 transitions. [2025-03-16 20:34:11,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 9 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:34:11,413 INFO L276 IsEmpty]: Start isEmpty. Operand 2418 states and 3782 transitions. [2025-03-16 20:34:11,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-16 20:34:11,415 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:34:11,415 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:34:11,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 20:34:11,416 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:34:11,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:34:11,416 INFO L85 PathProgramCache]: Analyzing trace with hash 713784645, now seen corresponding path program 1 times [2025-03-16 20:34:11,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:34:11,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848870072] [2025-03-16 20:34:11,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:34:11,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:34:11,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-16 20:34:11,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-16 20:34:11,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:34:11,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:34:11,792 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-16 20:34:11,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:34:11,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848870072] [2025-03-16 20:34:11,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848870072] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:34:11,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:34:11,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 20:34:11,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013713394] [2025-03-16 20:34:11,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:34:11,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 20:34:11,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:34:11,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 20:34:11,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:34:11,793 INFO L87 Difference]: Start difference. First operand 2418 states and 3782 transitions. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:34:12,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:34:12,030 INFO L93 Difference]: Finished difference Result 2528 states and 3958 transitions. [2025-03-16 20:34:12,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:34:12,031 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-03-16 20:34:12,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:34:12,037 INFO L225 Difference]: With dead ends: 2528 [2025-03-16 20:34:12,038 INFO L226 Difference]: Without dead ends: 2420 [2025-03-16 20:34:12,038 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2025-03-16 20:34:12,039 INFO L435 NwaCegarLoop]: 1573 mSDtfsCounter, 6060 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6060 SdHoareTripleChecker+Valid, 2089 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:34:12,039 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6060 Valid, 2089 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:34:12,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2420 states. [2025-03-16 20:34:12,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2420 to 2418. [2025-03-16 20:34:12,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2418 states, 2416 states have (on average 1.5649834437086092) internal successors, (3781), 2417 states have internal predecessors, (3781), 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-16 20:34:12,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2418 states to 2418 states and 3781 transitions. [2025-03-16 20:34:12,073 INFO L78 Accepts]: Start accepts. Automaton has 2418 states and 3781 transitions. Word has length 76 [2025-03-16 20:34:12,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:34:12,073 INFO L471 AbstractCegarLoop]: Abstraction has 2418 states and 3781 transitions. [2025-03-16 20:34:12,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:34:12,074 INFO L276 IsEmpty]: Start isEmpty. Operand 2418 states and 3781 transitions. [2025-03-16 20:34:12,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-16 20:34:12,074 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:34:12,074 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:34:12,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 20:34:12,075 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:34:12,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:34:12,075 INFO L85 PathProgramCache]: Analyzing trace with hash 712741960, now seen corresponding path program 1 times [2025-03-16 20:34:12,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:34:12,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991298559] [2025-03-16 20:34:12,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:34:12,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:34:12,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-16 20:34:12,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-16 20:34:12,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:34:12,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:34:12,145 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-16 20:34:12,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:34:12,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991298559] [2025-03-16 20:34:12,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991298559] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:34:12,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:34:12,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:34:12,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035438115] [2025-03-16 20:34:12,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:34:12,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:34:12,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:34:12,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:34:12,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:34:12,149 INFO L87 Difference]: Start difference. First operand 2418 states and 3781 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:34:12,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:34:12,178 INFO L93 Difference]: Finished difference Result 2623 states and 4110 transitions. [2025-03-16 20:34:12,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:34:12,179 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-03-16 20:34:12,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:34:12,186 INFO L225 Difference]: With dead ends: 2623 [2025-03-16 20:34:12,186 INFO L226 Difference]: Without dead ends: 2515 [2025-03-16 20:34:12,187 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-16 20:34:12,188 INFO L435 NwaCegarLoop]: 1578 mSDtfsCounter, 1498 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1498 SdHoareTripleChecker+Valid, 1660 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:34:12,188 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1498 Valid, 1660 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:34:12,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2515 states. [2025-03-16 20:34:12,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2515 to 2511. [2025-03-16 20:34:12,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2511 states, 2509 states have (on average 1.5655639697090473) internal successors, (3928), 2510 states have internal predecessors, (3928), 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-16 20:34:12,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2511 states to 2511 states and 3928 transitions. [2025-03-16 20:34:12,225 INFO L78 Accepts]: Start accepts. Automaton has 2511 states and 3928 transitions. Word has length 76 [2025-03-16 20:34:12,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:34:12,226 INFO L471 AbstractCegarLoop]: Abstraction has 2511 states and 3928 transitions. [2025-03-16 20:34:12,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:34:12,226 INFO L276 IsEmpty]: Start isEmpty. Operand 2511 states and 3928 transitions. [2025-03-16 20:34:12,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-16 20:34:12,228 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:34:12,228 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:34:12,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 20:34:12,228 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:34:12,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:34:12,229 INFO L85 PathProgramCache]: Analyzing trace with hash 653472575, now seen corresponding path program 1 times [2025-03-16 20:34:12,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:34:12,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620272617] [2025-03-16 20:34:12,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:34:12,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:34:12,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-16 20:34:12,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-16 20:34:12,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:34:12,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:34:12,546 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-16 20:34:12,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:34:12,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620272617] [2025-03-16 20:34:12,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620272617] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:34:12,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:34:12,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:34:12,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183639289] [2025-03-16 20:34:12,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:34:12,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:34:12,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:34:12,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:34:12,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:34:12,547 INFO L87 Difference]: Start difference. First operand 2511 states and 3928 transitions. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 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-16 20:34:12,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:34:12,650 INFO L93 Difference]: Finished difference Result 2517 states and 3935 transitions. [2025-03-16 20:34:12,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 20:34:12,651 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-03-16 20:34:12,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:34:12,659 INFO L225 Difference]: With dead ends: 2517 [2025-03-16 20:34:12,659 INFO L226 Difference]: Without dead ends: 2515 [2025-03-16 20:34:12,660 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:34:12,661 INFO L435 NwaCegarLoop]: 1578 mSDtfsCounter, 0 mSDsluCounter, 6301 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 7879 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:34:12,661 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 7879 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:34:12,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2515 states. [2025-03-16 20:34:12,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2515 to 2515. [2025-03-16 20:34:12,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2515 states, 2513 states have (on average 1.564265817747712) internal successors, (3931), 2514 states have internal predecessors, (3931), 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-16 20:34:12,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2515 states to 2515 states and 3931 transitions. [2025-03-16 20:34:12,696 INFO L78 Accepts]: Start accepts. Automaton has 2515 states and 3931 transitions. Word has length 77 [2025-03-16 20:34:12,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:34:12,696 INFO L471 AbstractCegarLoop]: Abstraction has 2515 states and 3931 transitions. [2025-03-16 20:34:12,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 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-16 20:34:12,697 INFO L276 IsEmpty]: Start isEmpty. Operand 2515 states and 3931 transitions. [2025-03-16 20:34:12,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-16 20:34:12,697 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:34:12,697 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:34:12,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 20:34:12,698 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:34:12,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:34:12,698 INFO L85 PathProgramCache]: Analyzing trace with hash 33059175, now seen corresponding path program 1 times [2025-03-16 20:34:12,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:34:12,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246818094] [2025-03-16 20:34:12,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:34:12,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:34:12,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-16 20:34:12,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-16 20:34:12,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:34:12,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:34:12,751 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-16 20:34:12,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:34:12,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246818094] [2025-03-16 20:34:12,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246818094] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:34:12,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:34:12,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:34:12,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387105583] [2025-03-16 20:34:12,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:34:12,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:34:12,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:34:12,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:34:12,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:34:12,753 INFO L87 Difference]: Start difference. First operand 2515 states and 3931 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:34:12,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:34:12,779 INFO L93 Difference]: Finished difference Result 2909 states and 4551 transitions. [2025-03-16 20:34:12,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:34:12,779 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-03-16 20:34:12,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:34:12,788 INFO L225 Difference]: With dead ends: 2909 [2025-03-16 20:34:12,788 INFO L226 Difference]: Without dead ends: 2704 [2025-03-16 20:34:12,789 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-16 20:34:12,789 INFO L435 NwaCegarLoop]: 1648 mSDtfsCounter, 1515 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1515 SdHoareTripleChecker+Valid, 1742 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:34:12,789 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1515 Valid, 1742 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:34:12,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2704 states. [2025-03-16 20:34:12,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2704 to 2702. [2025-03-16 20:34:12,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2702 states, 2700 states have (on average 1.5637037037037036) internal successors, (4222), 2701 states have internal predecessors, (4222), 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-16 20:34:12,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2702 states to 2702 states and 4222 transitions. [2025-03-16 20:34:12,835 INFO L78 Accepts]: Start accepts. Automaton has 2702 states and 4222 transitions. Word has length 78 [2025-03-16 20:34:12,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:34:12,835 INFO L471 AbstractCegarLoop]: Abstraction has 2702 states and 4222 transitions. [2025-03-16 20:34:12,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:34:12,835 INFO L276 IsEmpty]: Start isEmpty. Operand 2702 states and 4222 transitions. [2025-03-16 20:34:12,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-16 20:34:12,836 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:34:12,836 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:34:12,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 20:34:12,836 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:34:12,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:34:12,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1247783833, now seen corresponding path program 1 times [2025-03-16 20:34:12,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:34:12,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560209730] [2025-03-16 20:34:12,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:34:12,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:34:12,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-16 20:34:12,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-16 20:34:12,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:34:12,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:34:12,884 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-16 20:34:12,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:34:12,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560209730] [2025-03-16 20:34:12,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560209730] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:34:12,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:34:12,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:34:12,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150356684] [2025-03-16 20:34:12,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:34:12,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:34:12,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:34:12,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:34:12,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:34:12,885 INFO L87 Difference]: Start difference. First operand 2702 states and 4222 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:34:12,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:34:12,912 INFO L93 Difference]: Finished difference Result 3454 states and 5396 transitions. [2025-03-16 20:34:12,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:34:12,912 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-03-16 20:34:12,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:34:12,920 INFO L225 Difference]: With dead ends: 3454 [2025-03-16 20:34:12,920 INFO L226 Difference]: Without dead ends: 3062 [2025-03-16 20:34:12,921 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-16 20:34:12,922 INFO L435 NwaCegarLoop]: 1646 mSDtfsCounter, 1513 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1513 SdHoareTripleChecker+Valid, 1744 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:34:12,922 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1513 Valid, 1744 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:34:12,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3062 states. [2025-03-16 20:34:12,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3062 to 3060. [2025-03-16 20:34:12,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3060 states, 3058 states have (on average 1.5604970568999346) internal successors, (4772), 3059 states have internal predecessors, (4772), 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-16 20:34:12,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3060 states to 3060 states and 4772 transitions. [2025-03-16 20:34:12,969 INFO L78 Accepts]: Start accepts. Automaton has 3060 states and 4772 transitions. Word has length 78 [2025-03-16 20:34:12,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:34:12,970 INFO L471 AbstractCegarLoop]: Abstraction has 3060 states and 4772 transitions. [2025-03-16 20:34:12,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:34:12,970 INFO L276 IsEmpty]: Start isEmpty. Operand 3060 states and 4772 transitions. [2025-03-16 20:34:12,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-16 20:34:12,971 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:34:12,971 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:34:12,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 20:34:12,971 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:34:12,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:34:12,971 INFO L85 PathProgramCache]: Analyzing trace with hash -404424857, now seen corresponding path program 1 times [2025-03-16 20:34:12,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:34:12,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968731939] [2025-03-16 20:34:12,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:34:12,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:34:13,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-16 20:34:13,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-16 20:34:13,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:34:13,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:34:13,048 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-16 20:34:13,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:34:13,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968731939] [2025-03-16 20:34:13,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968731939] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:34:13,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:34:13,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:34:13,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131651015] [2025-03-16 20:34:13,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:34:13,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:34:13,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:34:13,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:34:13,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:34:13,050 INFO L87 Difference]: Start difference. First operand 3060 states and 4772 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:34:13,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:34:13,080 INFO L93 Difference]: Finished difference Result 4496 states and 6990 transitions. [2025-03-16 20:34:13,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:34:13,081 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-03-16 20:34:13,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:34:13,095 INFO L225 Difference]: With dead ends: 4496 [2025-03-16 20:34:13,095 INFO L226 Difference]: Without dead ends: 3746 [2025-03-16 20:34:13,097 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-16 20:34:13,098 INFO L435 NwaCegarLoop]: 1644 mSDtfsCounter, 1511 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1511 SdHoareTripleChecker+Valid, 1746 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:34:13,098 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1511 Valid, 1746 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:34:13,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3746 states. [2025-03-16 20:34:13,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3746 to 3744. [2025-03-16 20:34:13,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3744 states, 3742 states have (on average 1.5521111704970605) internal successors, (5808), 3743 states have internal predecessors, (5808), 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-16 20:34:13,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3744 states to 3744 states and 5808 transitions. [2025-03-16 20:34:13,154 INFO L78 Accepts]: Start accepts. Automaton has 3744 states and 5808 transitions. Word has length 78 [2025-03-16 20:34:13,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:34:13,154 INFO L471 AbstractCegarLoop]: Abstraction has 3744 states and 5808 transitions. [2025-03-16 20:34:13,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:34:13,154 INFO L276 IsEmpty]: Start isEmpty. Operand 3744 states and 5808 transitions. [2025-03-16 20:34:13,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-16 20:34:13,155 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:34:13,155 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:34:13,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 20:34:13,155 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:34:13,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:34:13,156 INFO L85 PathProgramCache]: Analyzing trace with hash 352615783, now seen corresponding path program 1 times [2025-03-16 20:34:13,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:34:13,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200523777] [2025-03-16 20:34:13,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:34:13,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:34:13,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-16 20:34:13,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-16 20:34:13,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:34:13,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:34:13,206 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-16 20:34:13,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:34:13,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200523777] [2025-03-16 20:34:13,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200523777] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:34:13,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:34:13,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:34:13,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991502455] [2025-03-16 20:34:13,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:34:13,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:34:13,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:34:13,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:34:13,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:34:13,208 INFO L87 Difference]: Start difference. First operand 3744 states and 5808 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:34:13,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:34:13,253 INFO L93 Difference]: Finished difference Result 6484 states and 9986 transitions. [2025-03-16 20:34:13,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:34:13,253 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-03-16 20:34:13,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:34:13,261 INFO L225 Difference]: With dead ends: 6484 [2025-03-16 20:34:13,262 INFO L226 Difference]: Without dead ends: 5050 [2025-03-16 20:34:13,264 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-16 20:34:13,264 INFO L435 NwaCegarLoop]: 1632 mSDtfsCounter, 1507 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1507 SdHoareTripleChecker+Valid, 1742 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:34:13,265 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1507 Valid, 1742 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:34:13,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5050 states. [2025-03-16 20:34:13,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5050 to 5048. [2025-03-16 20:34:13,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5048 states, 5046 states have (on average 1.5362663495838287) internal successors, (7752), 5047 states have internal predecessors, (7752), 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-16 20:34:13,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5048 states to 5048 states and 7752 transitions. [2025-03-16 20:34:13,346 INFO L78 Accepts]: Start accepts. Automaton has 5048 states and 7752 transitions. Word has length 78 [2025-03-16 20:34:13,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:34:13,347 INFO L471 AbstractCegarLoop]: Abstraction has 5048 states and 7752 transitions. [2025-03-16 20:34:13,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:34:13,348 INFO L276 IsEmpty]: Start isEmpty. Operand 5048 states and 7752 transitions. [2025-03-16 20:34:13,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-16 20:34:13,348 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:34:13,349 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:34:13,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 20:34:13,349 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:34:13,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:34:13,349 INFO L85 PathProgramCache]: Analyzing trace with hash -197173145, now seen corresponding path program 1 times [2025-03-16 20:34:13,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:34:13,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263475721] [2025-03-16 20:34:13,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:34:13,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:34:13,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-16 20:34:13,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-16 20:34:13,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:34:13,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:34:13,399 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-16 20:34:13,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:34:13,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263475721] [2025-03-16 20:34:13,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263475721] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:34:13,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:34:13,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:34:13,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178843817] [2025-03-16 20:34:13,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:34:13,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:34:13,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:34:13,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:34:13,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:34:13,402 INFO L87 Difference]: Start difference. First operand 5048 states and 7752 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:34:13,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:34:13,535 INFO L93 Difference]: Finished difference Result 10268 states and 15594 transitions. [2025-03-16 20:34:13,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:34:13,536 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-03-16 20:34:13,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:34:13,550 INFO L225 Difference]: With dead ends: 10268 [2025-03-16 20:34:13,550 INFO L226 Difference]: Without dead ends: 7530 [2025-03-16 20:34:13,555 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-16 20:34:13,556 INFO L435 NwaCegarLoop]: 1630 mSDtfsCounter, 1505 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1505 SdHoareTripleChecker+Valid, 1744 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:34:13,556 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1505 Valid, 1744 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:34:13,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7530 states. [2025-03-16 20:34:13,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7530 to 7528. [2025-03-16 20:34:13,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7528 states, 7526 states have (on average 1.5126229072548498) internal successors, (11384), 7527 states have internal predecessors, (11384), 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-16 20:34:13,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7528 states to 7528 states and 11384 transitions. [2025-03-16 20:34:13,708 INFO L78 Accepts]: Start accepts. Automaton has 7528 states and 11384 transitions. Word has length 78 [2025-03-16 20:34:13,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:34:13,708 INFO L471 AbstractCegarLoop]: Abstraction has 7528 states and 11384 transitions. [2025-03-16 20:34:13,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:34:13,708 INFO L276 IsEmpty]: Start isEmpty. Operand 7528 states and 11384 transitions. [2025-03-16 20:34:13,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-16 20:34:13,709 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:34:13,709 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:34:13,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 20:34:13,710 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:34:13,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:34:13,710 INFO L85 PathProgramCache]: Analyzing trace with hash 418798183, now seen corresponding path program 1 times [2025-03-16 20:34:13,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:34:13,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806100645] [2025-03-16 20:34:13,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:34:13,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:34:13,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-16 20:34:13,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-16 20:34:13,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:34:13,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:34:13,768 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-16 20:34:13,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:34:13,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806100645] [2025-03-16 20:34:13,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806100645] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:34:13,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:34:13,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:34:13,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147335479] [2025-03-16 20:34:13,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:34:13,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:34:13,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:34:13,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:34:13,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:34:13,770 INFO L87 Difference]: Start difference. First operand 7528 states and 11384 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:34:13,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:34:13,891 INFO L93 Difference]: Finished difference Result 17452 states and 26042 transitions. [2025-03-16 20:34:13,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:34:13,892 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-03-16 20:34:13,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:34:13,915 INFO L225 Difference]: With dead ends: 17452 [2025-03-16 20:34:13,915 INFO L226 Difference]: Without dead ends: 12234 [2025-03-16 20:34:13,979 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-16 20:34:13,980 INFO L435 NwaCegarLoop]: 1642 mSDtfsCounter, 1509 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1509 SdHoareTripleChecker+Valid, 1748 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:34:13,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1509 Valid, 1748 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:34:13,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12234 states. [2025-03-16 20:34:14,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12234 to 12232. [2025-03-16 20:34:14,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12232 states, 12230 states have (on average 1.4829108748977924) internal successors, (18136), 12231 states have internal predecessors, (18136), 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-16 20:34:14,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12232 states to 12232 states and 18136 transitions. [2025-03-16 20:34:14,186 INFO L78 Accepts]: Start accepts. Automaton has 12232 states and 18136 transitions. Word has length 78 [2025-03-16 20:34:14,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:34:14,187 INFO L471 AbstractCegarLoop]: Abstraction has 12232 states and 18136 transitions. [2025-03-16 20:34:14,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:34:14,187 INFO L276 IsEmpty]: Start isEmpty. Operand 12232 states and 18136 transitions. [2025-03-16 20:34:14,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-16 20:34:14,188 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:34:14,189 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:34:14,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 20:34:14,189 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:34:14,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:34:14,190 INFO L85 PathProgramCache]: Analyzing trace with hash 214626887, now seen corresponding path program 1 times [2025-03-16 20:34:14,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:34:14,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376390156] [2025-03-16 20:34:14,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:34:14,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:34:14,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-16 20:34:14,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-16 20:34:14,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:34:14,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:34:14,233 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-16 20:34:14,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:34:14,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376390156] [2025-03-16 20:34:14,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376390156] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:34:14,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:34:14,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:34:14,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211670836] [2025-03-16 20:34:14,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:34:14,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:34:14,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:34:14,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:34:14,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:34:14,236 INFO L87 Difference]: Start difference. First operand 12232 states and 18136 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:34:14,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:34:14,440 INFO L93 Difference]: Finished difference Result 22479 states and 33374 transitions. [2025-03-16 20:34:14,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:34:14,441 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2025-03-16 20:34:14,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:34:14,467 INFO L225 Difference]: With dead ends: 22479 [2025-03-16 20:34:14,468 INFO L226 Difference]: Without dead ends: 16972 [2025-03-16 20:34:14,476 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-16 20:34:14,476 INFO L435 NwaCegarLoop]: 1653 mSDtfsCounter, 1514 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1514 SdHoareTripleChecker+Valid, 1743 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:34:14,477 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1514 Valid, 1743 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:34:14,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16972 states. [2025-03-16 20:34:14,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16972 to 16970. [2025-03-16 20:34:14,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16970 states, 16968 states have (on average 1.4725365393682226) internal successors, (24986), 16969 states have internal predecessors, (24986), 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-16 20:34:14,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16970 states to 16970 states and 24986 transitions. [2025-03-16 20:34:14,911 INFO L78 Accepts]: Start accepts. Automaton has 16970 states and 24986 transitions. Word has length 80 [2025-03-16 20:34:14,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:34:14,912 INFO L471 AbstractCegarLoop]: Abstraction has 16970 states and 24986 transitions. [2025-03-16 20:34:14,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:34:14,916 INFO L276 IsEmpty]: Start isEmpty. Operand 16970 states and 24986 transitions. [2025-03-16 20:34:14,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-16 20:34:14,920 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:34:14,920 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 20:34:14,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 20:34:14,920 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:34:14,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:34:14,921 INFO L85 PathProgramCache]: Analyzing trace with hash -134352616, now seen corresponding path program 1 times [2025-03-16 20:34:14,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:34:14,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57826969] [2025-03-16 20:34:14,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:34:14,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:34:14,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-16 20:34:14,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-16 20:34:14,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:34:14,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:34:15,171 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-16 20:34:15,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:34:15,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57826969] [2025-03-16 20:34:15,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57826969] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:34:15,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:34:15,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 20:34:15,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034060228] [2025-03-16 20:34:15,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:34:15,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 20:34:15,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:34:15,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 20:34:15,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:34:15,173 INFO L87 Difference]: Start difference. First operand 16970 states and 24986 transitions. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 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-16 20:34:16,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:34:16,789 INFO L93 Difference]: Finished difference Result 122522 states and 178786 transitions. [2025-03-16 20:34:16,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:34:16,790 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 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 100 [2025-03-16 20:34:16,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:34:17,006 INFO L225 Difference]: With dead ends: 122522 [2025-03-16 20:34:17,007 INFO L226 Difference]: Without dead ends: 107864 [2025-03-16 20:34:17,036 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-03-16 20:34:17,036 INFO L435 NwaCegarLoop]: 1671 mSDtfsCounter, 9879 mSDsluCounter, 2815 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9879 SdHoareTripleChecker+Valid, 4486 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:34:17,037 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9879 Valid, 4486 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:34:17,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107864 states. [2025-03-16 20:34:18,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107864 to 31626. [2025-03-16 20:34:18,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31626 states, 31624 states have (on average 1.4599671135846193) internal successors, (46170), 31625 states have internal predecessors, (46170), 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-16 20:34:18,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31626 states to 31626 states and 46170 transitions. [2025-03-16 20:34:18,084 INFO L78 Accepts]: Start accepts. Automaton has 31626 states and 46170 transitions. Word has length 100 [2025-03-16 20:34:18,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:34:18,084 INFO L471 AbstractCegarLoop]: Abstraction has 31626 states and 46170 transitions. [2025-03-16 20:34:18,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 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-16 20:34:18,084 INFO L276 IsEmpty]: Start isEmpty. Operand 31626 states and 46170 transitions. [2025-03-16 20:34:18,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-16 20:34:18,088 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:34:18,089 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 20:34:18,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 20:34:18,089 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:34:18,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:34:18,089 INFO L85 PathProgramCache]: Analyzing trace with hash -1415195624, now seen corresponding path program 1 times [2025-03-16 20:34:18,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:34:18,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755435185] [2025-03-16 20:34:18,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:34:18,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:34:18,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-16 20:34:18,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-16 20:34:18,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:34:18,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:34:18,375 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-16 20:34:18,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:34:18,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755435185] [2025-03-16 20:34:18,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755435185] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:34:18,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:34:18,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 20:34:18,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931725761] [2025-03-16 20:34:18,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:34:18,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 20:34:18,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:34:18,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 20:34:18,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:34:18,378 INFO L87 Difference]: Start difference. First operand 31626 states and 46170 transitions. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 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-16 20:34:20,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:34:20,646 INFO L93 Difference]: Finished difference Result 137178 states and 199970 transitions. [2025-03-16 20:34:20,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:34:20,647 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 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 100 [2025-03-16 20:34:20,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:34:20,829 INFO L225 Difference]: With dead ends: 137178 [2025-03-16 20:34:20,829 INFO L226 Difference]: Without dead ends: 122520 [2025-03-16 20:34:20,878 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-03-16 20:34:20,879 INFO L435 NwaCegarLoop]: 1668 mSDtfsCounter, 9903 mSDsluCounter, 2682 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9903 SdHoareTripleChecker+Valid, 4350 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:34:20,880 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9903 Valid, 4350 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:34:20,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122520 states. [2025-03-16 20:34:22,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122520 to 53642. [2025-03-16 20:34:22,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53642 states, 53640 states have (on average 1.4501491424310216) internal successors, (77786), 53641 states have internal predecessors, (77786), 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-16 20:34:22,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53642 states to 53642 states and 77786 transitions. [2025-03-16 20:34:22,512 INFO L78 Accepts]: Start accepts. Automaton has 53642 states and 77786 transitions. Word has length 100 [2025-03-16 20:34:22,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:34:22,512 INFO L471 AbstractCegarLoop]: Abstraction has 53642 states and 77786 transitions. [2025-03-16 20:34:22,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 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-16 20:34:22,512 INFO L276 IsEmpty]: Start isEmpty. Operand 53642 states and 77786 transitions. [2025-03-16 20:34:22,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-16 20:34:22,517 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:34:22,517 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 20:34:22,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 20:34:22,518 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:34:22,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:34:22,518 INFO L85 PathProgramCache]: Analyzing trace with hash -571836648, now seen corresponding path program 1 times [2025-03-16 20:34:22,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:34:22,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671782916] [2025-03-16 20:34:22,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:34:22,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:34:22,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-16 20:34:22,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-16 20:34:22,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:34:22,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:34:22,672 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-16 20:34:22,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:34:22,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671782916] [2025-03-16 20:34:22,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671782916] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:34:22,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:34:22,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 20:34:22,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984216133] [2025-03-16 20:34:22,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:34:22,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 20:34:22,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:34:22,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 20:34:22,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:34:22,674 INFO L87 Difference]: Start difference. First operand 53642 states and 77786 transitions. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 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-16 20:34:25,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:34:25,295 INFO L93 Difference]: Finished difference Result 151834 states and 221154 transitions. [2025-03-16 20:34:25,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:34:25,295 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 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 100 [2025-03-16 20:34:25,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:34:25,502 INFO L225 Difference]: With dead ends: 151834 [2025-03-16 20:34:25,502 INFO L226 Difference]: Without dead ends: 137176 [2025-03-16 20:34:25,533 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-03-16 20:34:25,534 INFO L435 NwaCegarLoop]: 1665 mSDtfsCounter, 10003 mSDsluCounter, 2583 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10003 SdHoareTripleChecker+Valid, 4248 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:34:25,534 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10003 Valid, 4248 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:34:25,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137176 states. [2025-03-16 20:34:28,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137176 to 68298. [2025-03-16 20:34:28,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68298 states, 68296 states have (on average 1.4491331849595877) internal successors, (98970), 68297 states have internal predecessors, (98970), 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-16 20:34:28,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68298 states to 68298 states and 98970 transitions. [2025-03-16 20:34:28,240 INFO L78 Accepts]: Start accepts. Automaton has 68298 states and 98970 transitions. Word has length 100 [2025-03-16 20:34:28,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:34:28,241 INFO L471 AbstractCegarLoop]: Abstraction has 68298 states and 98970 transitions. [2025-03-16 20:34:28,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 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-16 20:34:28,241 INFO L276 IsEmpty]: Start isEmpty. Operand 68298 states and 98970 transitions. [2025-03-16 20:34:28,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-16 20:34:28,245 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:34:28,245 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 20:34:28,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 20:34:28,246 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:34:28,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:34:28,246 INFO L85 PathProgramCache]: Analyzing trace with hash 185203992, now seen corresponding path program 1 times [2025-03-16 20:34:28,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:34:28,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184238144] [2025-03-16 20:34:28,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:34:28,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:34:28,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-16 20:34:28,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-16 20:34:28,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:34:28,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:34:28,396 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 20:34:28,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:34:28,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184238144] [2025-03-16 20:34:28,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184238144] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:34:28,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:34:28,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 20:34:28,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688645915] [2025-03-16 20:34:28,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:34:28,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 20:34:28,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:34:28,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 20:34:28,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:34:28,398 INFO L87 Difference]: Start difference. First operand 68298 states and 98970 transitions. Second operand has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 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-16 20:34:31,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:34:31,437 INFO L93 Difference]: Finished difference Result 166490 states and 242338 transitions. [2025-03-16 20:34:31,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:34:31,438 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 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 100 [2025-03-16 20:34:31,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:34:31,691 INFO L225 Difference]: With dead ends: 166490 [2025-03-16 20:34:31,691 INFO L226 Difference]: Without dead ends: 151832 [2025-03-16 20:34:31,725 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-03-16 20:34:31,725 INFO L435 NwaCegarLoop]: 1662 mSDtfsCounter, 10088 mSDsluCounter, 2643 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10088 SdHoareTripleChecker+Valid, 4305 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:34:31,725 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10088 Valid, 4305 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:34:31,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151832 states. [2025-03-16 20:34:34,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151832 to 82954. [2025-03-16 20:34:34,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82954 states, 82952 states have (on average 1.4484762272157392) internal successors, (120154), 82953 states have internal predecessors, (120154), 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-16 20:34:34,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82954 states to 82954 states and 120154 transitions. [2025-03-16 20:34:34,731 INFO L78 Accepts]: Start accepts. Automaton has 82954 states and 120154 transitions. Word has length 100 [2025-03-16 20:34:34,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:34:34,731 INFO L471 AbstractCegarLoop]: Abstraction has 82954 states and 120154 transitions. [2025-03-16 20:34:34,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 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-16 20:34:34,731 INFO L276 IsEmpty]: Start isEmpty. Operand 82954 states and 120154 transitions. [2025-03-16 20:34:34,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-16 20:34:34,736 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:34:34,736 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 20:34:34,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 20:34:34,736 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:34:34,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:34:34,736 INFO L85 PathProgramCache]: Analyzing trace with hash -364584936, now seen corresponding path program 1 times [2025-03-16 20:34:34,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:34:34,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656763738] [2025-03-16 20:34:34,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:34:34,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:34:34,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-16 20:34:34,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-16 20:34:34,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:34:34,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:34:34,884 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-16 20:34:34,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:34:34,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656763738] [2025-03-16 20:34:34,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656763738] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:34:34,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:34:34,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 20:34:34,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132234280] [2025-03-16 20:34:34,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:34:34,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 20:34:34,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:34:34,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 20:34:34,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:34:34,886 INFO L87 Difference]: Start difference. First operand 82954 states and 120154 transitions. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 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-16 20:34:38,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:34:38,295 INFO L93 Difference]: Finished difference Result 181146 states and 263522 transitions. [2025-03-16 20:34:38,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:34:38,296 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 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 100 [2025-03-16 20:34:38,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:34:38,514 INFO L225 Difference]: With dead ends: 181146 [2025-03-16 20:34:38,514 INFO L226 Difference]: Without dead ends: 166488 [2025-03-16 20:34:38,555 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-03-16 20:34:38,555 INFO L435 NwaCegarLoop]: 1663 mSDtfsCounter, 9954 mSDsluCounter, 2654 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9954 SdHoareTripleChecker+Valid, 4317 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:34:38,555 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9954 Valid, 4317 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:34:38,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166488 states. [2025-03-16 20:34:41,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166488 to 97610. [2025-03-16 20:34:41,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97610 states, 97608 states have (on average 1.4480165560199985) internal successors, (141338), 97609 states have internal predecessors, (141338), 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-16 20:34:41,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97610 states to 97610 states and 141338 transitions. [2025-03-16 20:34:41,406 INFO L78 Accepts]: Start accepts. Automaton has 97610 states and 141338 transitions. Word has length 100 [2025-03-16 20:34:41,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:34:41,406 INFO L471 AbstractCegarLoop]: Abstraction has 97610 states and 141338 transitions. [2025-03-16 20:34:41,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 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-16 20:34:41,406 INFO L276 IsEmpty]: Start isEmpty. Operand 97610 states and 141338 transitions. [2025-03-16 20:34:41,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-16 20:34:41,412 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:34:41,412 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 20:34:41,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 20:34:41,412 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:34:41,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:34:41,412 INFO L85 PathProgramCache]: Analyzing trace with hash 251386392, now seen corresponding path program 1 times [2025-03-16 20:34:41,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:34:41,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378182409] [2025-03-16 20:34:41,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:34:41,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:34:41,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-16 20:34:41,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-16 20:34:41,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:34:41,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:34:41,546 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-16 20:34:41,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:34:41,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378182409] [2025-03-16 20:34:41,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378182409] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:34:41,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:34:41,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 20:34:41,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324266145] [2025-03-16 20:34:41,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:34:41,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 20:34:41,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:34:41,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 20:34:41,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:34:41,548 INFO L87 Difference]: Start difference. First operand 97610 states and 141338 transitions. Second operand has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 9 states have internal predecessors, (91), 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-16 20:34:44,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:34:44,740 INFO L93 Difference]: Finished difference Result 195802 states and 284706 transitions. [2025-03-16 20:34:44,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:34:44,740 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 9 states have internal predecessors, (91), 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 100 [2025-03-16 20:34:44,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:34:45,007 INFO L225 Difference]: With dead ends: 195802 [2025-03-16 20:34:45,007 INFO L226 Difference]: Without dead ends: 181144 [2025-03-16 20:34:45,057 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-03-16 20:34:45,058 INFO L435 NwaCegarLoop]: 1670 mSDtfsCounter, 9817 mSDsluCounter, 2873 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9817 SdHoareTripleChecker+Valid, 4543 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:34:45,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9817 Valid, 4543 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:34:45,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181144 states. [2025-03-16 20:34:48,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181144 to 112266. [2025-03-16 20:34:48,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112266 states, 112264 states have (on average 1.4476769044395355) internal successors, (162522), 112265 states have internal predecessors, (162522), 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-16 20:34:48,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112266 states to 112266 states and 162522 transitions. [2025-03-16 20:34:48,299 INFO L78 Accepts]: Start accepts. Automaton has 112266 states and 162522 transitions. Word has length 100 [2025-03-16 20:34:48,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:34:48,299 INFO L471 AbstractCegarLoop]: Abstraction has 112266 states and 162522 transitions. [2025-03-16 20:34:48,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 9 states have internal predecessors, (91), 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-16 20:34:48,299 INFO L276 IsEmpty]: Start isEmpty. Operand 112266 states and 162522 transitions. [2025-03-16 20:34:48,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-16 20:34:48,305 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:34:48,305 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 20:34:48,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 20:34:48,305 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:34:48,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:34:48,306 INFO L85 PathProgramCache]: Analyzing trace with hash -226662886, now seen corresponding path program 1 times [2025-03-16 20:34:48,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:34:48,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086113655] [2025-03-16 20:34:48,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:34:48,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:34:48,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-16 20:34:48,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-16 20:34:48,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:34:48,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:34:48,372 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:34:48,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:34:48,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086113655] [2025-03-16 20:34:48,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086113655] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:34:48,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:34:48,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:34:48,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136957575] [2025-03-16 20:34:48,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:34:48,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:34:48,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:34:48,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:34:48,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:34:48,374 INFO L87 Difference]: Start difference. First operand 112266 states and 162522 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 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)