./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.6.ufo.UNBOUNDED.pals+Problem12_label01.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.6.ufo.UNBOUNDED.pals+Problem12_label01.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 726c27beb485f609d605f0581621ddf01187954349267fe751f77dd8e4a5e6ab --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 20:32:05,194 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 20:32:05,237 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 20:32:05,240 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 20:32:05,241 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 20:32:05,260 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 20:32:05,262 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 20:32:05,262 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 20:32:05,262 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 20:32:05,262 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 20:32:05,263 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 20:32:05,263 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 20:32:05,263 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 20:32:05,263 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 20:32:05,264 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 20:32:05,264 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 20:32:05,264 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 20:32:05,264 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 20:32:05,264 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 20:32:05,264 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 20:32:05,264 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 20:32:05,264 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 20:32:05,265 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 20:32:05,265 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 20:32:05,265 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 20:32:05,265 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 20:32:05,265 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 20:32:05,265 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 20:32:05,265 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 20:32:05,265 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 20:32:05,265 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 20:32:05,265 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 20:32:05,266 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 20:32:05,266 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 20:32:05,266 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 20:32:05,266 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 20:32:05,266 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 20:32:05,266 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 20:32:05,266 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 20:32:05,266 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 20:32:05,266 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 20:32:05,266 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 20:32:05,266 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 20:32:05,266 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 -> 726c27beb485f609d605f0581621ddf01187954349267fe751f77dd8e4a5e6ab [2025-03-16 20:32:05,507 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 20:32:05,514 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 20:32:05,516 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 20:32:05,517 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 20:32:05,517 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 20:32:05,519 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.6.ufo.UNBOUNDED.pals+Problem12_label01.c [2025-03-16 20:32:06,648 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6132acf0/e8ed5a657efe4cb5bce201e4aadae4b9/FLAG3bd0d7734 [2025-03-16 20:32:07,020 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 20:32:07,021 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.6.ufo.UNBOUNDED.pals+Problem12_label01.c [2025-03-16 20:32:07,048 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6132acf0/e8ed5a657efe4cb5bce201e4aadae4b9/FLAG3bd0d7734 [2025-03-16 20:32:07,062 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6132acf0/e8ed5a657efe4cb5bce201e4aadae4b9 [2025-03-16 20:32:07,064 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 20:32:07,065 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 20:32:07,066 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 20:32:07,066 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 20:32:07,069 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 20:32:07,070 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 08:32:07" (1/1) ... [2025-03-16 20:32:07,070 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19411080 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:32:07, skipping insertion in model container [2025-03-16 20:32:07,071 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 08:32:07" (1/1) ... [2025-03-16 20:32:07,135 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 20:32:07,432 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.6.ufo.UNBOUNDED.pals+Problem12_label01.c[15510,15523] [2025-03-16 20:32:07,471 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.6.ufo.UNBOUNDED.pals+Problem12_label01.c[21065,21078] [2025-03-16 20:32:07,897 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 20:32:07,910 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 20:32:07,946 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.6.ufo.UNBOUNDED.pals+Problem12_label01.c[15510,15523] [2025-03-16 20:32:07,951 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.6.ufo.UNBOUNDED.pals+Problem12_label01.c[21065,21078] [2025-03-16 20:32:08,174 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 20:32:08,194 INFO L204 MainTranslator]: Completed translation [2025-03-16 20:32:08,195 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:32:08 WrapperNode [2025-03-16 20:32:08,195 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 20:32:08,196 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 20:32:08,196 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 20:32:08,197 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 20:32:08,201 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:32:08" (1/1) ... [2025-03-16 20:32:08,233 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:32:08" (1/1) ... [2025-03-16 20:32:08,423 INFO L138 Inliner]: procedures = 38, calls = 23, calls flagged for inlining = 18, calls inlined = 18, statements flattened = 5151 [2025-03-16 20:32:08,424 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 20:32:08,424 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 20:32:08,425 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 20:32:08,425 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 20:32:08,431 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:32:08" (1/1) ... [2025-03-16 20:32:08,431 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:32:08" (1/1) ... [2025-03-16 20:32:08,499 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:32:08" (1/1) ... [2025-03-16 20:32:08,595 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:32:08,595 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:32:08" (1/1) ... [2025-03-16 20:32:08,595 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:32:08" (1/1) ... [2025-03-16 20:32:08,727 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:32:08" (1/1) ... [2025-03-16 20:32:08,752 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:32:08" (1/1) ... [2025-03-16 20:32:08,768 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:32:08" (1/1) ... [2025-03-16 20:32:08,779 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:32:08" (1/1) ... [2025-03-16 20:32:08,815 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 20:32:08,817 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 20:32:08,817 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 20:32:08,817 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 20:32:08,818 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:32:08" (1/1) ... [2025-03-16 20:32:08,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 20:32:08,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:32:08,844 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:32:08,847 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:32:08,864 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 20:32:08,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 20:32:08,864 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 20:32:08,864 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 20:32:08,935 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 20:32:08,936 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 20:32:11,966 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3685: havoc calculate_output2_#t~ret42#1; [2025-03-16 20:32:11,966 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5175: havoc calculate_output3_#t~ret43#1; [2025-03-16 20:32:11,967 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2206: havoc calculate_output_#t~ret41#1; [2025-03-16 20:32:12,094 INFO L? ?]: Removed 745 outVars from TransFormulas that were not future-live. [2025-03-16 20:32:12,095 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 20:32:12,125 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 20:32:12,126 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 20:32:12,126 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:32:12 BoogieIcfgContainer [2025-03-16 20:32:12,126 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 20:32:12,128 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 20:32:12,128 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 20:32:12,132 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 20:32:12,132 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 08:32:07" (1/3) ... [2025-03-16 20:32:12,132 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@580c2d01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 08:32:12, skipping insertion in model container [2025-03-16 20:32:12,133 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:32:08" (2/3) ... [2025-03-16 20:32:12,133 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@580c2d01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 08:32:12, skipping insertion in model container [2025-03-16 20:32:12,133 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:32:12" (3/3) ... [2025-03-16 20:32:12,134 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.ufo.UNBOUNDED.pals+Problem12_label01.c [2025-03-16 20:32:12,147 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 20:32:12,149 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.6.ufo.UNBOUNDED.pals+Problem12_label01.c that has 1 procedures, 851 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-03-16 20:32:12,225 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 20:32:12,233 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;@62aab518, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 20:32:12,234 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-16 20:32:12,238 INFO L276 IsEmpty]: Start isEmpty. Operand has 851 states, 848 states have (on average 1.9705188679245282) internal successors, (1671), 850 states have internal predecessors, (1671), 0 states have call successors, (0), 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:32:12,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-16 20:32:12,243 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:32:12,243 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] [2025-03-16 20:32:12,244 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:32:12,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:32:12,247 INFO L85 PathProgramCache]: Analyzing trace with hash 382305243, now seen corresponding path program 1 times [2025-03-16 20:32:12,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:32:12,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616953347] [2025-03-16 20:32:12,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:32:12,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:32:12,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-16 20:32:12,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-16 20:32:12,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:32:12,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:32:12,434 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:32:12,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:32:12,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616953347] [2025-03-16 20:32:12,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616953347] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:32:12,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:32:12,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 20:32:12,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064124215] [2025-03-16 20:32:12,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:32:12,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 20:32:12,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:32:12,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 20:32:12,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 20:32:12,456 INFO L87 Difference]: Start difference. First operand has 851 states, 848 states have (on average 1.9705188679245282) internal successors, (1671), 850 states have internal predecessors, (1671), 0 states have call successors, (0), 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 11.5) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 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:32:12,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:32:12,524 INFO L93 Difference]: Finished difference Result 1658 states and 3256 transitions. [2025-03-16 20:32:12,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 20:32:12,526 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2025-03-16 20:32:12,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:32:12,536 INFO L225 Difference]: With dead ends: 1658 [2025-03-16 20:32:12,536 INFO L226 Difference]: Without dead ends: 847 [2025-03-16 20:32:12,541 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:32:12,545 INFO L435 NwaCegarLoop]: 1606 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, 1606 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:32:12,545 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1606 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:32:12,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states. [2025-03-16 20:32:12,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 847. [2025-03-16 20:32:12,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 847 states, 845 states have (on average 1.8958579881656805) internal successors, (1602), 846 states have internal predecessors, (1602), 0 states have call successors, (0), 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:32:12,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 1602 transitions. [2025-03-16 20:32:12,605 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 1602 transitions. Word has length 23 [2025-03-16 20:32:12,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:32:12,606 INFO L471 AbstractCegarLoop]: Abstraction has 847 states and 1602 transitions. [2025-03-16 20:32:12,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 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:32:12,606 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 1602 transitions. [2025-03-16 20:32:12,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-16 20:32:12,607 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:32:12,607 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] [2025-03-16 20:32:12,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 20:32:12,607 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:32:12,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:32:12,608 INFO L85 PathProgramCache]: Analyzing trace with hash -462166628, now seen corresponding path program 1 times [2025-03-16 20:32:12,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:32:12,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705871229] [2025-03-16 20:32:12,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:32:12,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:32:12,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-16 20:32:12,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-16 20:32:12,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:32:12,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:32:12,861 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:32:12,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:32:12,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705871229] [2025-03-16 20:32:12,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705871229] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:32:12,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:32:12,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 20:32:12,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347973025] [2025-03-16 20:32:12,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:32:12,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 20:32:12,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:32:12,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 20:32:12,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:32:12,864 INFO L87 Difference]: Start difference. First operand 847 states and 1602 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 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:32:12,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:32:12,967 INFO L93 Difference]: Finished difference Result 899 states and 1684 transitions. [2025-03-16 20:32:12,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:32:12,967 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2025-03-16 20:32:12,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:32:12,971 INFO L225 Difference]: With dead ends: 899 [2025-03-16 20:32:12,972 INFO L226 Difference]: Without dead ends: 847 [2025-03-16 20:32:12,972 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:32:12,973 INFO L435 NwaCegarLoop]: 1601 mSDtfsCounter, 0 mSDsluCounter, 3158 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4759 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:32:12,973 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4759 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:32:12,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states. [2025-03-16 20:32:12,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 847. [2025-03-16 20:32:12,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 847 states, 845 states have (on average 1.8485207100591716) internal successors, (1562), 846 states have internal predecessors, (1562), 0 states have call successors, (0), 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:32:12,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 1562 transitions. [2025-03-16 20:32:12,997 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 1562 transitions. Word has length 23 [2025-03-16 20:32:12,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:32:12,998 INFO L471 AbstractCegarLoop]: Abstraction has 847 states and 1562 transitions. [2025-03-16 20:32:12,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 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:32:12,998 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 1562 transitions. [2025-03-16 20:32:12,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-16 20:32:12,999 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:32:12,999 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] [2025-03-16 20:32:12,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 20:32:13,000 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:32:13,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:32:13,000 INFO L85 PathProgramCache]: Analyzing trace with hash 975059731, now seen corresponding path program 1 times [2025-03-16 20:32:13,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:32:13,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401038948] [2025-03-16 20:32:13,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:32:13,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:32:13,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-16 20:32:13,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-16 20:32:13,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:32:13,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:32:13,236 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:32:13,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:32:13,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401038948] [2025-03-16 20:32:13,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401038948] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:32:13,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:32:13,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:32:13,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890140191] [2025-03-16 20:32:13,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:32:13,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 20:32:13,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:32:13,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 20:32:13,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:32:13,237 INFO L87 Difference]: Start difference. First operand 847 states and 1562 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 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:32:17,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:32:17,929 INFO L93 Difference]: Finished difference Result 3102 states and 5871 transitions. [2025-03-16 20:32:17,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:32:17,930 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 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 47 [2025-03-16 20:32:17,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:32:17,938 INFO L225 Difference]: With dead ends: 3102 [2025-03-16 20:32:17,938 INFO L226 Difference]: Without dead ends: 2349 [2025-03-16 20:32:17,941 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:32:17,942 INFO L435 NwaCegarLoop]: 798 mSDtfsCounter, 2464 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 5354 mSolverCounterSat, 1153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2464 SdHoareTripleChecker+Valid, 816 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.6s IncrementalHoareTripleChecker+Time [2025-03-16 20:32:17,942 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2464 Valid, 816 Invalid, 6507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1153 Valid, 5354 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2025-03-16 20:32:17,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2349 states. [2025-03-16 20:32:17,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2349 to 2349. [2025-03-16 20:32:17,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2349 states, 2347 states have (on average 1.566254793353217) internal successors, (3676), 2348 states have internal predecessors, (3676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:32:17,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2349 states to 2349 states and 3676 transitions. [2025-03-16 20:32:17,990 INFO L78 Accepts]: Start accepts. Automaton has 2349 states and 3676 transitions. Word has length 47 [2025-03-16 20:32:17,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:32:17,990 INFO L471 AbstractCegarLoop]: Abstraction has 2349 states and 3676 transitions. [2025-03-16 20:32:17,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 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:32:17,991 INFO L276 IsEmpty]: Start isEmpty. Operand 2349 states and 3676 transitions. [2025-03-16 20:32:17,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-16 20:32:17,995 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:32:17,995 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] [2025-03-16 20:32:17,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 20:32:17,995 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:32:17,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:32:17,996 INFO L85 PathProgramCache]: Analyzing trace with hash -858517098, now seen corresponding path program 1 times [2025-03-16 20:32:17,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:32:17,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509761612] [2025-03-16 20:32:17,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:32:17,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:32:18,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-16 20:32:18,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-16 20:32:18,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:32:18,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:32:18,182 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:32:18,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:32:18,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509761612] [2025-03-16 20:32:18,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509761612] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:32:18,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:32:18,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 20:32:18,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166504109] [2025-03-16 20:32:18,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:32:18,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 20:32:18,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:32:18,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 20:32:18,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 20:32:18,184 INFO L87 Difference]: Start difference. First operand 2349 states and 3676 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 0 states have call successors, (0), 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:32:18,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:32:18,381 INFO L93 Difference]: Finished difference Result 2937 states and 4624 transitions. [2025-03-16 20:32:18,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 20:32:18,383 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2025-03-16 20:32:18,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:32:18,391 INFO L225 Difference]: With dead ends: 2937 [2025-03-16 20:32:18,391 INFO L226 Difference]: Without dead ends: 2888 [2025-03-16 20:32:18,392 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2025-03-16 20:32:18,393 INFO L435 NwaCegarLoop]: 1556 mSDtfsCounter, 9770 mSDsluCounter, 1759 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9770 SdHoareTripleChecker+Valid, 3315 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:32:18,393 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9770 Valid, 3315 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:32:18,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2888 states. [2025-03-16 20:32:18,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2888 to 2396. [2025-03-16 20:32:18,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2396 states, 2394 states have (on average 1.567251461988304) internal successors, (3752), 2395 states have internal predecessors, (3752), 0 states have call successors, (0), 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:32:18,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2396 states to 2396 states and 3752 transitions. [2025-03-16 20:32:18,428 INFO L78 Accepts]: Start accepts. Automaton has 2396 states and 3752 transitions. Word has length 62 [2025-03-16 20:32:18,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:32:18,428 INFO L471 AbstractCegarLoop]: Abstraction has 2396 states and 3752 transitions. [2025-03-16 20:32:18,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 0 states have call successors, (0), 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:32:18,429 INFO L276 IsEmpty]: Start isEmpty. Operand 2396 states and 3752 transitions. [2025-03-16 20:32:18,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-16 20:32:18,430 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:32:18,430 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] [2025-03-16 20:32:18,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 20:32:18,430 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:32:18,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:32:18,430 INFO L85 PathProgramCache]: Analyzing trace with hash -364028136, now seen corresponding path program 1 times [2025-03-16 20:32:18,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:32:18,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235025682] [2025-03-16 20:32:18,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:32:18,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:32:18,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-16 20:32:18,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-16 20:32:18,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:32:18,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:32:18,720 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:32:18,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:32:18,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235025682] [2025-03-16 20:32:18,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235025682] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:32:18,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:32:18,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 20:32:18,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039560902] [2025-03-16 20:32:18,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:32:18,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 20:32:18,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:32:18,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 20:32:18,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-16 20:32:18,722 INFO L87 Difference]: Start difference. First operand 2396 states and 3752 transitions. Second operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 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:32:18,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:32:18,902 INFO L93 Difference]: Finished difference Result 2494 states and 3908 transitions. [2025-03-16 20:32:18,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 20:32:18,903 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2025-03-16 20:32:18,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:32:18,910 INFO L225 Difference]: With dead ends: 2494 [2025-03-16 20:32:18,910 INFO L226 Difference]: Without dead ends: 2398 [2025-03-16 20:32:18,911 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2025-03-16 20:32:18,911 INFO L435 NwaCegarLoop]: 1554 mSDtfsCounter, 3026 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3026 SdHoareTripleChecker+Valid, 1941 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:32:18,912 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3026 Valid, 1941 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:32:18,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2398 states. [2025-03-16 20:32:18,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2398 to 2396. [2025-03-16 20:32:18,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2396 states, 2394 states have (on average 1.5668337510442774) internal successors, (3751), 2395 states have internal predecessors, (3751), 0 states have call successors, (0), 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:32:18,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2396 states to 2396 states and 3751 transitions. [2025-03-16 20:32:18,946 INFO L78 Accepts]: Start accepts. Automaton has 2396 states and 3751 transitions. Word has length 64 [2025-03-16 20:32:18,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:32:18,947 INFO L471 AbstractCegarLoop]: Abstraction has 2396 states and 3751 transitions. [2025-03-16 20:32:18,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 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:32:18,947 INFO L276 IsEmpty]: Start isEmpty. Operand 2396 states and 3751 transitions. [2025-03-16 20:32:18,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-16 20:32:18,948 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:32:18,948 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] [2025-03-16 20:32:18,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 20:32:18,949 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:32:18,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:32:18,949 INFO L85 PathProgramCache]: Analyzing trace with hash -365070821, now seen corresponding path program 1 times [2025-03-16 20:32:18,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:32:18,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607072894] [2025-03-16 20:32:18,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:32:18,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:32:18,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-16 20:32:18,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-16 20:32:18,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:32:18,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:32:19,035 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:32:19,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:32:19,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607072894] [2025-03-16 20:32:19,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607072894] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:32:19,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:32:19,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:32:19,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132266428] [2025-03-16 20:32:19,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:32:19,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:32:19,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:32:19,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:32:19,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:32:19,036 INFO L87 Difference]: Start difference. First operand 2396 states and 3751 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 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:32:19,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:32:19,066 INFO L93 Difference]: Finished difference Result 2577 states and 4040 transitions. [2025-03-16 20:32:19,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:32:19,067 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2025-03-16 20:32:19,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:32:19,074 INFO L225 Difference]: With dead ends: 2577 [2025-03-16 20:32:19,075 INFO L226 Difference]: Without dead ends: 2481 [2025-03-16 20:32:19,075 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:32:19,077 INFO L435 NwaCegarLoop]: 1558 mSDtfsCounter, 1490 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1490 SdHoareTripleChecker+Valid, 1630 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:32:19,077 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1490 Valid, 1630 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:32:19,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2481 states. [2025-03-16 20:32:19,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2481 to 2477. [2025-03-16 20:32:19,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2477 states, 2475 states have (on average 1.566868686868687) internal successors, (3878), 2476 states have internal predecessors, (3878), 0 states have call successors, (0), 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:32:19,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2477 states to 2477 states and 3878 transitions. [2025-03-16 20:32:19,114 INFO L78 Accepts]: Start accepts. Automaton has 2477 states and 3878 transitions. Word has length 64 [2025-03-16 20:32:19,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:32:19,114 INFO L471 AbstractCegarLoop]: Abstraction has 2477 states and 3878 transitions. [2025-03-16 20:32:19,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 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:32:19,114 INFO L276 IsEmpty]: Start isEmpty. Operand 2477 states and 3878 transitions. [2025-03-16 20:32:19,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-16 20:32:19,115 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:32:19,115 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] [2025-03-16 20:32:19,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 20:32:19,115 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:32:19,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:32:19,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1601014732, now seen corresponding path program 1 times [2025-03-16 20:32:19,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:32:19,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764820628] [2025-03-16 20:32:19,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:32:19,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:32:19,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-16 20:32:19,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-16 20:32:19,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:32:19,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:32:19,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:32:19,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:32:19,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764820628] [2025-03-16 20:32:19,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764820628] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:32:19,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:32:19,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:32:19,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117669422] [2025-03-16 20:32:19,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:32:19,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:32:19,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:32:19,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:32:19,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:32:19,324 INFO L87 Difference]: Start difference. First operand 2477 states and 3878 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 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:32:19,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:32:19,401 INFO L93 Difference]: Finished difference Result 2483 states and 3885 transitions. [2025-03-16 20:32:19,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 20:32:19,402 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2025-03-16 20:32:19,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:32:19,409 INFO L225 Difference]: With dead ends: 2483 [2025-03-16 20:32:19,409 INFO L226 Difference]: Without dead ends: 2481 [2025-03-16 20:32:19,410 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:32:19,411 INFO L435 NwaCegarLoop]: 1558 mSDtfsCounter, 0 mSDsluCounter, 6221 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 7779 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.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:32:19,411 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 7779 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:32:19,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2481 states. [2025-03-16 20:32:19,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2481 to 2481. [2025-03-16 20:32:19,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2481 states, 2479 states have (on average 1.5655506252521179) internal successors, (3881), 2480 states have internal predecessors, (3881), 0 states have call successors, (0), 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:32:19,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2481 states to 2481 states and 3881 transitions. [2025-03-16 20:32:19,451 INFO L78 Accepts]: Start accepts. Automaton has 2481 states and 3881 transitions. Word has length 65 [2025-03-16 20:32:19,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:32:19,452 INFO L471 AbstractCegarLoop]: Abstraction has 2481 states and 3881 transitions. [2025-03-16 20:32:19,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 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:32:19,452 INFO L276 IsEmpty]: Start isEmpty. Operand 2481 states and 3881 transitions. [2025-03-16 20:32:19,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-16 20:32:19,452 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:32:19,452 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:32:19,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 20:32:19,453 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:32:19,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:32:19,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1938748038, now seen corresponding path program 1 times [2025-03-16 20:32:19,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:32:19,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887835835] [2025-03-16 20:32:19,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:32:19,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:32:19,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-16 20:32:19,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-16 20:32:19,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:32:19,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:32:19,514 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:32:19,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:32:19,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887835835] [2025-03-16 20:32:19,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887835835] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:32:19,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:32:19,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:32:19,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717663419] [2025-03-16 20:32:19,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:32:19,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:32:19,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:32:19,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:32:19,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:32:19,516 INFO L87 Difference]: Start difference. First operand 2481 states and 3881 transitions. Second operand has 3 states, 3 states have (on average 22.0) 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:32:19,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:32:19,542 INFO L93 Difference]: Finished difference Result 2827 states and 4421 transitions. [2025-03-16 20:32:19,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:32:19,543 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) 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:32:19,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:32:19,550 INFO L225 Difference]: With dead ends: 2827 [2025-03-16 20:32:19,550 INFO L226 Difference]: Without dead ends: 2646 [2025-03-16 20:32:19,552 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:32:19,554 INFO L435 NwaCegarLoop]: 1618 mSDtfsCounter, 1505 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1505 SdHoareTripleChecker+Valid, 1702 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:32:19,554 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1505 Valid, 1702 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:32:19,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2646 states. [2025-03-16 20:32:19,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2646 to 2644. [2025-03-16 20:32:19,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2644 states, 2642 states have (on average 1.5639666919000756) internal successors, (4132), 2643 states have internal predecessors, (4132), 0 states have call successors, (0), 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:32:19,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2644 states to 2644 states and 4132 transitions. [2025-03-16 20:32:19,598 INFO L78 Accepts]: Start accepts. Automaton has 2644 states and 4132 transitions. Word has length 66 [2025-03-16 20:32:19,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:32:19,600 INFO L471 AbstractCegarLoop]: Abstraction has 2644 states and 4132 transitions. [2025-03-16 20:32:19,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) 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:32:19,600 INFO L276 IsEmpty]: Start isEmpty. Operand 2644 states and 4132 transitions. [2025-03-16 20:32:19,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-16 20:32:19,602 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:32:19,602 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:32:19,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 20:32:19,602 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:32:19,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:32:19,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1095389062, now seen corresponding path program 1 times [2025-03-16 20:32:19,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:32:19,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059024558] [2025-03-16 20:32:19,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:32:19,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:32:19,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-16 20:32:19,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-16 20:32:19,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:32:19,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:32:19,647 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:32:19,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:32:19,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059024558] [2025-03-16 20:32:19,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059024558] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:32:19,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:32:19,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:32:19,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993262549] [2025-03-16 20:32:19,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:32:19,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:32:19,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:32:19,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:32:19,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:32:19,648 INFO L87 Difference]: Start difference. First operand 2644 states and 4132 transitions. Second operand has 3 states, 3 states have (on average 22.0) 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:32:19,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:32:19,673 INFO L93 Difference]: Finished difference Result 3300 states and 5146 transitions. [2025-03-16 20:32:19,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:32:19,674 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) 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:32:19,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:32:19,682 INFO L225 Difference]: With dead ends: 3300 [2025-03-16 20:32:19,682 INFO L226 Difference]: Without dead ends: 2956 [2025-03-16 20:32:19,683 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:32:19,683 INFO L435 NwaCegarLoop]: 1616 mSDtfsCounter, 1503 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1503 SdHoareTripleChecker+Valid, 1704 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:32:19,683 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1503 Valid, 1704 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:32:19,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2956 states. [2025-03-16 20:32:19,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2956 to 2954. [2025-03-16 20:32:19,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2954 states, 2952 states have (on average 1.5589430894308942) internal successors, (4602), 2953 states have internal predecessors, (4602), 0 states have call successors, (0), 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:32:19,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2954 states to 2954 states and 4602 transitions. [2025-03-16 20:32:19,726 INFO L78 Accepts]: Start accepts. Automaton has 2954 states and 4602 transitions. Word has length 66 [2025-03-16 20:32:19,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:32:19,727 INFO L471 AbstractCegarLoop]: Abstraction has 2954 states and 4602 transitions. [2025-03-16 20:32:19,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) 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:32:19,727 INFO L276 IsEmpty]: Start isEmpty. Operand 2954 states and 4602 transitions. [2025-03-16 20:32:19,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-16 20:32:19,727 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:32:19,727 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:32:19,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 20:32:19,727 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:32:19,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:32:19,728 INFO L85 PathProgramCache]: Analyzing trace with hash -338348422, now seen corresponding path program 1 times [2025-03-16 20:32:19,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:32:19,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732408731] [2025-03-16 20:32:19,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:32:19,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:32:19,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-16 20:32:19,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-16 20:32:19,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:32:19,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:32:19,769 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:32:19,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:32:19,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732408731] [2025-03-16 20:32:19,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732408731] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:32:19,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:32:19,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:32:19,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789496778] [2025-03-16 20:32:19,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:32:19,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:32:19,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:32:19,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:32:19,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:32:19,770 INFO L87 Difference]: Start difference. First operand 2954 states and 4602 transitions. Second operand has 3 states, 3 states have (on average 22.0) 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:32:19,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:32:19,802 INFO L93 Difference]: Finished difference Result 4198 states and 6500 transitions. [2025-03-16 20:32:19,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:32:19,803 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) 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:32:19,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:32:19,815 INFO L225 Difference]: With dead ends: 4198 [2025-03-16 20:32:19,815 INFO L226 Difference]: Without dead ends: 3544 [2025-03-16 20:32:19,817 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:32:19,817 INFO L435 NwaCegarLoop]: 1604 mSDtfsCounter, 1499 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1499 SdHoareTripleChecker+Valid, 1700 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:32:19,817 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1499 Valid, 1700 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:32:19,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3544 states. [2025-03-16 20:32:19,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3544 to 3542. [2025-03-16 20:32:19,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3542 states, 3540 states have (on average 1.547457627118644) internal successors, (5478), 3541 states have internal predecessors, (5478), 0 states have call successors, (0), 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:32:19,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3542 states to 3542 states and 5478 transitions. [2025-03-16 20:32:19,879 INFO L78 Accepts]: Start accepts. Automaton has 3542 states and 5478 transitions. Word has length 66 [2025-03-16 20:32:19,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:32:19,879 INFO L471 AbstractCegarLoop]: Abstraction has 3542 states and 5478 transitions. [2025-03-16 20:32:19,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) 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:32:19,879 INFO L276 IsEmpty]: Start isEmpty. Operand 3542 states and 5478 transitions. [2025-03-16 20:32:19,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-16 20:32:19,882 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:32:19,883 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:32:19,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 20:32:19,883 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:32:19,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:32:19,884 INFO L85 PathProgramCache]: Analyzing trace with hash -888137350, now seen corresponding path program 1 times [2025-03-16 20:32:19,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:32:19,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328263913] [2025-03-16 20:32:19,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:32:19,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:32:19,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-16 20:32:19,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-16 20:32:19,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:32:19,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:32:19,925 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:32:19,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:32:19,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328263913] [2025-03-16 20:32:19,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328263913] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:32:19,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:32:19,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:32:19,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017292449] [2025-03-16 20:32:19,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:32:19,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:32:19,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:32:19,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:32:19,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:32:19,927 INFO L87 Difference]: Start difference. First operand 3542 states and 5478 transitions. Second operand has 3 states, 3 states have (on average 22.0) 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:32:19,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:32:19,966 INFO L93 Difference]: Finished difference Result 5898 states and 9016 transitions. [2025-03-16 20:32:19,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:32:19,966 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) 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:32:19,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:32:19,980 INFO L225 Difference]: With dead ends: 5898 [2025-03-16 20:32:19,980 INFO L226 Difference]: Without dead ends: 4656 [2025-03-16 20:32:19,982 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:32:19,983 INFO L435 NwaCegarLoop]: 1602 mSDtfsCounter, 1497 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1497 SdHoareTripleChecker+Valid, 1702 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:32:19,983 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1497 Valid, 1702 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:32:19,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4656 states. [2025-03-16 20:32:20,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4656 to 4654. [2025-03-16 20:32:20,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4654 states, 4652 states have (on average 1.5266552020636286) internal successors, (7102), 4653 states have internal predecessors, (7102), 0 states have call successors, (0), 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:32:20,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4654 states to 4654 states and 7102 transitions. [2025-03-16 20:32:20,070 INFO L78 Accepts]: Start accepts. Automaton has 4654 states and 7102 transitions. Word has length 66 [2025-03-16 20:32:20,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:32:20,070 INFO L471 AbstractCegarLoop]: Abstraction has 4654 states and 7102 transitions. [2025-03-16 20:32:20,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) 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:32:20,070 INFO L276 IsEmpty]: Start isEmpty. Operand 4654 states and 7102 transitions. [2025-03-16 20:32:20,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-16 20:32:20,071 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:32:20,071 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:32:20,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 20:32:20,071 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:32:20,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:32:20,072 INFO L85 PathProgramCache]: Analyzing trace with hash -272166022, now seen corresponding path program 1 times [2025-03-16 20:32:20,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:32:20,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563030221] [2025-03-16 20:32:20,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:32:20,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:32:20,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-16 20:32:20,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-16 20:32:20,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:32:20,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:32:20,119 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:32:20,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:32:20,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563030221] [2025-03-16 20:32:20,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563030221] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:32:20,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:32:20,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:32:20,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856188428] [2025-03-16 20:32:20,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:32:20,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:32:20,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:32:20,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:32:20,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:32:20,121 INFO L87 Difference]: Start difference. First operand 4654 states and 7102 transitions. Second operand has 3 states, 3 states have (on average 22.0) 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:32:20,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:32:20,187 INFO L93 Difference]: Finished difference Result 9106 states and 13664 transitions. [2025-03-16 20:32:20,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:32:20,187 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) 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:32:20,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:32:20,198 INFO L225 Difference]: With dead ends: 9106 [2025-03-16 20:32:20,198 INFO L226 Difference]: Without dead ends: 6752 [2025-03-16 20:32:20,202 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:32:20,202 INFO L435 NwaCegarLoop]: 1614 mSDtfsCounter, 1501 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1501 SdHoareTripleChecker+Valid, 1706 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:32:20,202 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1501 Valid, 1706 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:32:20,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6752 states. [2025-03-16 20:32:20,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6752 to 6750. [2025-03-16 20:32:20,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6750 states, 6748 states have (on average 1.495850622406639) internal successors, (10094), 6749 states have internal predecessors, (10094), 0 states have call successors, (0), 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:32:20,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6750 states to 6750 states and 10094 transitions. [2025-03-16 20:32:20,375 INFO L78 Accepts]: Start accepts. Automaton has 6750 states and 10094 transitions. Word has length 66 [2025-03-16 20:32:20,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:32:20,375 INFO L471 AbstractCegarLoop]: Abstraction has 6750 states and 10094 transitions. [2025-03-16 20:32:20,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) 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:32:20,375 INFO L276 IsEmpty]: Start isEmpty. Operand 6750 states and 10094 transitions. [2025-03-16 20:32:20,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-16 20:32:20,376 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:32:20,376 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] [2025-03-16 20:32:20,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 20:32:20,376 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:32:20,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:32:20,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1055373978, now seen corresponding path program 1 times [2025-03-16 20:32:20,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:32:20,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010680855] [2025-03-16 20:32:20,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:32:20,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:32:20,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-16 20:32:20,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-16 20:32:20,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:32:20,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:32:20,425 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:32:20,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:32:20,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010680855] [2025-03-16 20:32:20,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010680855] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:32:20,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:32:20,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:32:20,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159638480] [2025-03-16 20:32:20,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:32:20,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:32:20,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:32:20,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:32:20,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:32:20,427 INFO L87 Difference]: Start difference. First operand 6750 states and 10094 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:32:20,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:32:20,543 INFO L93 Difference]: Finished difference Result 11365 states and 16948 transitions. [2025-03-16 20:32:20,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:32:20,544 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-03-16 20:32:20,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:32:20,559 INFO L225 Difference]: With dead ends: 11365 [2025-03-16 20:32:20,559 INFO L226 Difference]: Without dead ends: 8866 [2025-03-16 20:32:20,564 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:32:20,565 INFO L435 NwaCegarLoop]: 1623 mSDtfsCounter, 1504 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1504 SdHoareTripleChecker+Valid, 1703 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:32:20,565 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1504 Valid, 1703 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:32:20,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8866 states. [2025-03-16 20:32:20,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8866 to 8864. [2025-03-16 20:32:20,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8864 states, 8862 states have (on average 1.4822839088241933) internal successors, (13136), 8863 states have internal predecessors, (13136), 0 states have call successors, (0), 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:32:20,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8864 states to 8864 states and 13136 transitions. [2025-03-16 20:32:20,715 INFO L78 Accepts]: Start accepts. Automaton has 8864 states and 13136 transitions. Word has length 68 [2025-03-16 20:32:20,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:32:20,715 INFO L471 AbstractCegarLoop]: Abstraction has 8864 states and 13136 transitions. [2025-03-16 20:32:20,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:32:20,716 INFO L276 IsEmpty]: Start isEmpty. Operand 8864 states and 13136 transitions. [2025-03-16 20:32:20,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-16 20:32:20,718 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:32:20,718 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:32:20,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 20:32:20,718 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:32:20,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:32:20,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1763107670, now seen corresponding path program 1 times [2025-03-16 20:32:20,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:32:20,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425106637] [2025-03-16 20:32:20,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:32:20,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:32:20,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-16 20:32:20,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-16 20:32:20,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:32:20,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:32:20,866 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-16 20:32:20,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:32:20,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425106637] [2025-03-16 20:32:20,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425106637] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:32:20,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:32:20,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 20:32:20,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796564360] [2025-03-16 20:32:20,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:32:20,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 20:32:20,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:32:20,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 20:32:20,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 20:32:20,868 INFO L87 Difference]: Start difference. First operand 8864 states and 13136 transitions. Second operand has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 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:32:21,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:32:21,445 INFO L93 Difference]: Finished difference Result 49582 states and 72247 transitions. [2025-03-16 20:32:21,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 20:32:21,445 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2025-03-16 20:32:21,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:32:21,520 INFO L225 Difference]: With dead ends: 49582 [2025-03-16 20:32:21,520 INFO L226 Difference]: Without dead ends: 43020 [2025-03-16 20:32:21,541 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-16 20:32:21,542 INFO L435 NwaCegarLoop]: 1638 mSDtfsCounter, 8100 mSDsluCounter, 2281 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8100 SdHoareTripleChecker+Valid, 3919 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:32:21,542 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8100 Valid, 3919 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:32:21,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43020 states. [2025-03-16 20:32:21,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43020 to 15424. [2025-03-16 20:32:22,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15424 states, 15422 states have (on average 1.4638827648813384) internal successors, (22576), 15423 states have internal predecessors, (22576), 0 states have call successors, (0), 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:32:22,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15424 states to 15424 states and 22576 transitions. [2025-03-16 20:32:22,023 INFO L78 Accepts]: Start accepts. Automaton has 15424 states and 22576 transitions. Word has length 86 [2025-03-16 20:32:22,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:32:22,024 INFO L471 AbstractCegarLoop]: Abstraction has 15424 states and 22576 transitions. [2025-03-16 20:32:22,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 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:32:22,024 INFO L276 IsEmpty]: Start isEmpty. Operand 15424 states and 22576 transitions. [2025-03-16 20:32:22,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-16 20:32:22,026 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:32:22,026 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:32:22,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 20:32:22,026 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:32:22,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:32:22,027 INFO L85 PathProgramCache]: Analyzing trace with hash -919748694, now seen corresponding path program 1 times [2025-03-16 20:32:22,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:32:22,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908230601] [2025-03-16 20:32:22,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:32:22,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:32:22,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-16 20:32:22,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-16 20:32:22,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:32:22,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:32:22,164 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-16 20:32:22,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:32:22,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908230601] [2025-03-16 20:32:22,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908230601] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:32:22,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:32:22,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 20:32:22,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548370160] [2025-03-16 20:32:22,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:32:22,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 20:32:22,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:32:22,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 20:32:22,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 20:32:22,166 INFO L87 Difference]: Start difference. First operand 15424 states and 22576 transitions. Second operand has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 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:32:22,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:32:22,853 INFO L93 Difference]: Finished difference Result 56142 states and 81687 transitions. [2025-03-16 20:32:22,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 20:32:22,854 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2025-03-16 20:32:22,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:32:22,915 INFO L225 Difference]: With dead ends: 56142 [2025-03-16 20:32:22,915 INFO L226 Difference]: Without dead ends: 49580 [2025-03-16 20:32:22,931 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-16 20:32:22,932 INFO L435 NwaCegarLoop]: 1635 mSDtfsCounter, 8144 mSDsluCounter, 2180 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8144 SdHoareTripleChecker+Valid, 3815 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:32:22,932 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8144 Valid, 3815 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:32:22,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49580 states. [2025-03-16 20:32:23,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49580 to 25280. [2025-03-16 20:32:23,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25280 states, 25278 states have (on average 1.4501147242661603) internal successors, (36656), 25279 states have internal predecessors, (36656), 0 states have call successors, (0), 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:32:23,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25280 states to 25280 states and 36656 transitions. [2025-03-16 20:32:23,774 INFO L78 Accepts]: Start accepts. Automaton has 25280 states and 36656 transitions. Word has length 86 [2025-03-16 20:32:23,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:32:23,774 INFO L471 AbstractCegarLoop]: Abstraction has 25280 states and 36656 transitions. [2025-03-16 20:32:23,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 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:32:23,774 INFO L276 IsEmpty]: Start isEmpty. Operand 25280 states and 36656 transitions. [2025-03-16 20:32:23,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-16 20:32:23,777 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:32:23,777 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:32:23,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 20:32:23,777 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:32:23,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:32:23,778 INFO L85 PathProgramCache]: Analyzing trace with hash -162708054, now seen corresponding path program 1 times [2025-03-16 20:32:23,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:32:23,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417867840] [2025-03-16 20:32:23,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:32:23,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:32:23,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-16 20:32:23,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-16 20:32:23,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:32:23,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:32:23,933 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-16 20:32:23,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:32:23,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417867840] [2025-03-16 20:32:23,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417867840] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:32:23,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:32:23,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 20:32:23,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867967242] [2025-03-16 20:32:23,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:32:23,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 20:32:23,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:32:23,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 20:32:23,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 20:32:23,935 INFO L87 Difference]: Start difference. First operand 25280 states and 36656 transitions. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 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:32:25,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:32:25,031 INFO L93 Difference]: Finished difference Result 62702 states and 91127 transitions. [2025-03-16 20:32:25,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 20:32:25,032 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 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 86 [2025-03-16 20:32:25,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:32:25,093 INFO L225 Difference]: With dead ends: 62702 [2025-03-16 20:32:25,093 INFO L226 Difference]: Without dead ends: 56140 [2025-03-16 20:32:25,107 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-16 20:32:25,107 INFO L435 NwaCegarLoop]: 1632 mSDtfsCounter, 8211 mSDsluCounter, 2218 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8211 SdHoareTripleChecker+Valid, 3850 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:32:25,108 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8211 Valid, 3850 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:32:25,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56140 states. [2025-03-16 20:32:25,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56140 to 31840. [2025-03-16 20:32:25,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31840 states, 31838 states have (on average 1.4478296375400466) internal successors, (46096), 31839 states have internal predecessors, (46096), 0 states have call successors, (0), 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:32:25,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31840 states to 31840 states and 46096 transitions. [2025-03-16 20:32:25,958 INFO L78 Accepts]: Start accepts. Automaton has 31840 states and 46096 transitions. Word has length 86 [2025-03-16 20:32:25,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:32:25,958 INFO L471 AbstractCegarLoop]: Abstraction has 31840 states and 46096 transitions. [2025-03-16 20:32:25,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 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:32:25,958 INFO L276 IsEmpty]: Start isEmpty. Operand 31840 states and 46096 transitions. [2025-03-16 20:32:25,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-16 20:32:25,961 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:32:25,961 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:32:25,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 20:32:25,961 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:32:25,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:32:25,962 INFO L85 PathProgramCache]: Analyzing trace with hash -712496982, now seen corresponding path program 1 times [2025-03-16 20:32:25,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:32:25,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232210946] [2025-03-16 20:32:25,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:32:25,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:32:25,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-16 20:32:25,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-16 20:32:25,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:32:25,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:32:26,084 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 20:32:26,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:32:26,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232210946] [2025-03-16 20:32:26,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232210946] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:32:26,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:32:26,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 20:32:26,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285387991] [2025-03-16 20:32:26,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:32:26,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 20:32:26,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:32:26,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 20:32:26,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 20:32:26,086 INFO L87 Difference]: Start difference. First operand 31840 states and 46096 transitions. Second operand has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 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:32:27,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:32:27,017 INFO L93 Difference]: Finished difference Result 69262 states and 100567 transitions. [2025-03-16 20:32:27,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 20:32:27,018 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2025-03-16 20:32:27,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:32:27,087 INFO L225 Difference]: With dead ends: 69262 [2025-03-16 20:32:27,087 INFO L226 Difference]: Without dead ends: 62700 [2025-03-16 20:32:27,101 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-16 20:32:27,102 INFO L435 NwaCegarLoop]: 1633 mSDtfsCounter, 8130 mSDsluCounter, 2223 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8130 SdHoareTripleChecker+Valid, 3856 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:32:27,102 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8130 Valid, 3856 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:32:27,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62700 states. [2025-03-16 20:32:27,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62700 to 38400. [2025-03-16 20:32:27,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38400 states, 38398 states have (on average 1.446325329444242) internal successors, (55536), 38399 states have internal predecessors, (55536), 0 states have call successors, (0), 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:32:27,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38400 states to 38400 states and 55536 transitions. [2025-03-16 20:32:27,955 INFO L78 Accepts]: Start accepts. Automaton has 38400 states and 55536 transitions. Word has length 86 [2025-03-16 20:32:27,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:32:27,955 INFO L471 AbstractCegarLoop]: Abstraction has 38400 states and 55536 transitions. [2025-03-16 20:32:27,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 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:32:27,955 INFO L276 IsEmpty]: Start isEmpty. Operand 38400 states and 55536 transitions. [2025-03-16 20:32:27,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-16 20:32:27,957 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:32:27,958 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:32:27,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 20:32:27,958 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:32:27,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:32:27,958 INFO L85 PathProgramCache]: Analyzing trace with hash -96525654, now seen corresponding path program 1 times [2025-03-16 20:32:27,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:32:27,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669684026] [2025-03-16 20:32:27,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:32:27,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:32:27,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-16 20:32:27,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-16 20:32:27,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:32:27,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:32:28,150 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-16 20:32:28,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:32:28,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669684026] [2025-03-16 20:32:28,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669684026] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:32:28,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:32:28,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 20:32:28,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220157003] [2025-03-16 20:32:28,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:32:28,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 20:32:28,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:32:28,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 20:32:28,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 20:32:28,151 INFO L87 Difference]: Start difference. First operand 38400 states and 55536 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:32:29,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:32:29,901 INFO L93 Difference]: Finished difference Result 75822 states and 110007 transitions. [2025-03-16 20:32:29,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 20:32:29,901 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2025-03-16 20:32:29,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:32:29,977 INFO L225 Difference]: With dead ends: 75822 [2025-03-16 20:32:29,977 INFO L226 Difference]: Without dead ends: 69260 [2025-03-16 20:32:29,987 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-16 20:32:29,988 INFO L435 NwaCegarLoop]: 1638 mSDtfsCounter, 8038 mSDsluCounter, 2363 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8038 SdHoareTripleChecker+Valid, 4001 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:32:29,988 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8038 Valid, 4001 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:32:30,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69260 states. [2025-03-16 20:32:30,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69260 to 44960. [2025-03-16 20:32:31,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44960 states, 44958 states have (on average 1.4452600204635437) internal successors, (64976), 44959 states have internal predecessors, (64976), 0 states have call successors, (0), 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:32:31,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44960 states to 44960 states and 64976 transitions. [2025-03-16 20:32:31,125 INFO L78 Accepts]: Start accepts. Automaton has 44960 states and 64976 transitions. Word has length 86 [2025-03-16 20:32:31,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:32:31,125 INFO L471 AbstractCegarLoop]: Abstraction has 44960 states and 64976 transitions. [2025-03-16 20:32:31,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:32:31,125 INFO L276 IsEmpty]: Start isEmpty. Operand 44960 states and 64976 transitions. [2025-03-16 20:32:31,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-16 20:32:31,128 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:32:31,128 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] [2025-03-16 20:32:31,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 20:32:31,128 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:32:31,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:32:31,129 INFO L85 PathProgramCache]: Analyzing trace with hash -2092174036, now seen corresponding path program 1 times [2025-03-16 20:32:31,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:32:31,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465111437] [2025-03-16 20:32:31,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:32:31,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:32:31,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-16 20:32:31,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-16 20:32:31,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:32:31,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:32:31,194 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:32:31,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:32:31,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465111437] [2025-03-16 20:32:31,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465111437] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:32:31,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:32:31,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:32:31,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791156603] [2025-03-16 20:32:31,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:32:31,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:32:31,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:32:31,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:32:31,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:32:31,195 INFO L87 Difference]: Start difference. First operand 44960 states and 64976 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 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:32:31,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:32:31,655 INFO L93 Difference]: Finished difference Result 74937 states and 108680 transitions. [2025-03-16 20:32:31,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:32:31,655 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2025-03-16 20:32:31,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:32:31,694 INFO L225 Difference]: With dead ends: 74937 [2025-03-16 20:32:31,695 INFO L226 Difference]: Without dead ends: 32279 [2025-03-16 20:32:31,729 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:32:31,729 INFO L435 NwaCegarLoop]: 1610 mSDtfsCounter, 58 mSDsluCounter, 1547 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 3157 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:32:31,730 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 3157 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:32:31,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32279 states. [2025-03-16 20:32:32,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32279 to 32277. [2025-03-16 20:32:32,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32277 states, 32275 states have (on average 1.4526723470178156) internal successors, (46885), 32276 states have internal predecessors, (46885), 0 states have call successors, (0), 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:32:32,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32277 states to 32277 states and 46885 transitions. [2025-03-16 20:32:32,472 INFO L78 Accepts]: Start accepts. Automaton has 32277 states and 46885 transitions. Word has length 88 [2025-03-16 20:32:32,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:32:32,473 INFO L471 AbstractCegarLoop]: Abstraction has 32277 states and 46885 transitions. [2025-03-16 20:32:32,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 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:32:32,473 INFO L276 IsEmpty]: Start isEmpty. Operand 32277 states and 46885 transitions. [2025-03-16 20:32:32,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-16 20:32:32,474 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:32:32,474 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:32:32,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 20:32:32,475 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:32:32,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:32:32,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1952924214, now seen corresponding path program 1 times [2025-03-16 20:32:32,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:32:32,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196667921] [2025-03-16 20:32:32,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:32:32,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:32:32,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-16 20:32:32,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-16 20:32:32,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:32:32,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:32:32,587 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 20:32:32,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:32:32,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196667921] [2025-03-16 20:32:32,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196667921] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:32:32,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:32:32,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 20:32:32,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240803794] [2025-03-16 20:32:32,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:32:32,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 20:32:32,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:32:32,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 20:32:32,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 20:32:32,588 INFO L87 Difference]: Start difference. First operand 32277 states and 46885 transitions. Second operand has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 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:32:33,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:32:33,786 INFO L93 Difference]: Finished difference Result 59939 states and 87212 transitions. [2025-03-16 20:32:33,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 20:32:33,787 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 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 88 [2025-03-16 20:32:33,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:32:33,861 INFO L225 Difference]: With dead ends: 59939 [2025-03-16 20:32:33,861 INFO L226 Difference]: Without dead ends: 55329 [2025-03-16 20:32:33,878 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-16 20:32:33,878 INFO L435 NwaCegarLoop]: 1630 mSDtfsCounter, 8104 mSDsluCounter, 2458 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8104 SdHoareTripleChecker+Valid, 4088 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:32:33,878 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8104 Valid, 4088 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:32:33,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55329 states. [2025-03-16 20:32:35,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55329 to 36885. [2025-03-16 20:32:35,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36885 states, 36883 states have (on average 1.4516443890139088) internal successors, (53541), 36884 states have internal predecessors, (53541), 0 states have call successors, (0), 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:32:35,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36885 states to 36885 states and 53541 transitions. [2025-03-16 20:32:35,299 INFO L78 Accepts]: Start accepts. Automaton has 36885 states and 53541 transitions. Word has length 88 [2025-03-16 20:32:35,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:32:35,299 INFO L471 AbstractCegarLoop]: Abstraction has 36885 states and 53541 transitions. [2025-03-16 20:32:35,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 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:32:35,299 INFO L276 IsEmpty]: Start isEmpty. Operand 36885 states and 53541 transitions. [2025-03-16 20:32:35,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-16 20:32:35,301 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:32:35,301 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:32:35,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 20:32:35,301 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:32:35,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:32:35,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1726696622, now seen corresponding path program 1 times [2025-03-16 20:32:35,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:32:35,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746972853] [2025-03-16 20:32:35,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:32:35,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:32:35,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-16 20:32:35,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-16 20:32:35,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:32:35,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:32:35,367 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:32:35,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:32:35,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746972853] [2025-03-16 20:32:35,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746972853] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:32:35,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:32:35,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:32:35,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599969555] [2025-03-16 20:32:35,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:32:35,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:32:35,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:32:35,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:32:35,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:32:35,370 INFO L87 Difference]: Start difference. First operand 36885 states and 53541 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 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:32:35,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:32:35,701 INFO L93 Difference]: Finished difference Result 54169 states and 78503 transitions. [2025-03-16 20:32:35,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:32:35,702 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 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 89 [2025-03-16 20:32:35,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:32:35,727 INFO L225 Difference]: With dead ends: 54169 [2025-03-16 20:32:35,727 INFO L226 Difference]: Without dead ends: 19607 [2025-03-16 20:32:35,752 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:32:35,753 INFO L435 NwaCegarLoop]: 1603 mSDtfsCounter, 53 mSDsluCounter, 1539 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 3142 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:32:35,753 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 3142 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:32:35,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19607 states. [2025-03-16 20:32:36,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19607 to 19605. [2025-03-16 20:32:36,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19605 states, 19603 states have (on average 1.4457480997806458) internal successors, (28341), 19604 states have internal predecessors, (28341), 0 states have call successors, (0), 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:32:36,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19605 states to 19605 states and 28341 transitions. [2025-03-16 20:32:36,263 INFO L78 Accepts]: Start accepts. Automaton has 19605 states and 28341 transitions. Word has length 89 [2025-03-16 20:32:36,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:32:36,264 INFO L471 AbstractCegarLoop]: Abstraction has 19605 states and 28341 transitions. [2025-03-16 20:32:36,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 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:32:36,264 INFO L276 IsEmpty]: Start isEmpty. Operand 19605 states and 28341 transitions. [2025-03-16 20:32:36,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-16 20:32:36,265 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:32:36,265 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:32:36,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-16 20:32:36,265 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:32:36,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:32:36,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1478915573, now seen corresponding path program 1 times [2025-03-16 20:32:36,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:32:36,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649496721] [2025-03-16 20:32:36,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:32:36,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:32:36,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-16 20:32:36,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-16 20:32:36,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:32:36,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:32:36,323 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:32:36,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:32:36,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649496721] [2025-03-16 20:32:36,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649496721] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:32:36,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:32:36,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:32:36,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369025149] [2025-03-16 20:32:36,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:32:36,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:32:36,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:32:36,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:32:36,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:32:36,325 INFO L87 Difference]: Start difference. First operand 19605 states and 28341 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 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:32:36,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:32:36,496 INFO L93 Difference]: Finished difference Result 28249 states and 40703 transitions. [2025-03-16 20:32:36,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:32:36,496 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2025-03-16 20:32:36,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:32:36,509 INFO L225 Difference]: With dead ends: 28249 [2025-03-16 20:32:36,510 INFO L226 Difference]: Without dead ends: 10967 [2025-03-16 20:32:36,521 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:32:36,523 INFO L435 NwaCegarLoop]: 1596 mSDtfsCounter, 50 mSDsluCounter, 1531 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 3127 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:32:36,523 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 3127 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:32:36,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10967 states. [2025-03-16 20:32:36,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10967 to 10965. [2025-03-16 20:32:36,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10965 states, 10963 states have (on average 1.4467755176502781) internal successors, (15861), 10964 states have internal predecessors, (15861), 0 states have call successors, (0), 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:32:36,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10965 states to 10965 states and 15861 transitions. [2025-03-16 20:32:36,731 INFO L78 Accepts]: Start accepts. Automaton has 10965 states and 15861 transitions. Word has length 91 [2025-03-16 20:32:36,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:32:36,731 INFO L471 AbstractCegarLoop]: Abstraction has 10965 states and 15861 transitions. [2025-03-16 20:32:36,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 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:32:36,731 INFO L276 IsEmpty]: Start isEmpty. Operand 10965 states and 15861 transitions. [2025-03-16 20:32:36,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-16 20:32:36,732 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:32:36,732 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:32:36,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-16 20:32:36,732 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:32:36,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:32:36,733 INFO L85 PathProgramCache]: Analyzing trace with hash 551699396, now seen corresponding path program 1 times [2025-03-16 20:32:36,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:32:36,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364588497] [2025-03-16 20:32:36,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:32:36,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:32:36,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-16 20:32:36,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-16 20:32:36,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:32:36,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:32:36,791 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:32:36,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:32:36,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364588497] [2025-03-16 20:32:36,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364588497] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:32:36,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:32:36,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:32:36,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128718562] [2025-03-16 20:32:36,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:32:36,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:32:36,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:32:36,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:32:36,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:32:36,792 INFO L87 Difference]: Start difference. First operand 10965 states and 15861 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 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:32:36,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:32:36,881 INFO L93 Difference]: Finished difference Result 15289 states and 21983 transitions. [2025-03-16 20:32:36,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:32:36,881 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 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 93 [2025-03-16 20:32:36,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:32:36,889 INFO L225 Difference]: With dead ends: 15289 [2025-03-16 20:32:36,890 INFO L226 Difference]: Without dead ends: 6647 [2025-03-16 20:32:36,895 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:32:36,895 INFO L435 NwaCegarLoop]: 1589 mSDtfsCounter, 47 mSDsluCounter, 1523 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 3112 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:32:36,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 3112 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:32:36,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6647 states. [2025-03-16 20:32:36,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6647 to 6645. [2025-03-16 20:32:36,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6645 states, 6643 states have (on average 1.4573234984193888) internal successors, (9681), 6644 states have internal predecessors, (9681), 0 states have call successors, (0), 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:32:37,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6645 states to 6645 states and 9681 transitions. [2025-03-16 20:32:37,002 INFO L78 Accepts]: Start accepts. Automaton has 6645 states and 9681 transitions. Word has length 93 [2025-03-16 20:32:37,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:32:37,002 INFO L471 AbstractCegarLoop]: Abstraction has 6645 states and 9681 transitions. [2025-03-16 20:32:37,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 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:32:37,002 INFO L276 IsEmpty]: Start isEmpty. Operand 6645 states and 9681 transitions. [2025-03-16 20:32:37,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-16 20:32:37,003 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:32:37,003 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:32:37,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-16 20:32:37,003 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:32:37,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:32:37,004 INFO L85 PathProgramCache]: Analyzing trace with hash 2030858365, now seen corresponding path program 1 times [2025-03-16 20:32:37,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:32:37,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447133532] [2025-03-16 20:32:37,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:32:37,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:32:37,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-16 20:32:37,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-16 20:32:37,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:32:37,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:32:37,066 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:32:37,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:32:37,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447133532] [2025-03-16 20:32:37,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447133532] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:32:37,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:32:37,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:32:37,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607733745] [2025-03-16 20:32:37,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:32:37,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:32:37,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:32:37,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:32:37,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:32:37,069 INFO L87 Difference]: Start difference. First operand 6645 states and 9681 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 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:32:37,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:32:37,124 INFO L93 Difference]: Finished difference Result 8809 states and 12713 transitions. [2025-03-16 20:32:37,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:32:37,125 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 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 95 [2025-03-16 20:32:37,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:32:37,132 INFO L225 Difference]: With dead ends: 8809 [2025-03-16 20:32:37,132 INFO L226 Difference]: Without dead ends: 4487 [2025-03-16 20:32:37,135 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:32:37,136 INFO L435 NwaCegarLoop]: 1582 mSDtfsCounter, 44 mSDsluCounter, 1515 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 3097 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:32:37,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 3097 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:32:37,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4487 states. [2025-03-16 20:32:37,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4487 to 4485. [2025-03-16 20:32:37,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4485 states, 4483 states have (on average 1.4769127816194512) internal successors, (6621), 4484 states have internal predecessors, (6621), 0 states have call successors, (0), 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:32:37,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4485 states to 4485 states and 6621 transitions. [2025-03-16 20:32:37,208 INFO L78 Accepts]: Start accepts. Automaton has 4485 states and 6621 transitions. Word has length 95 [2025-03-16 20:32:37,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:32:37,208 INFO L471 AbstractCegarLoop]: Abstraction has 4485 states and 6621 transitions. [2025-03-16 20:32:37,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 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:32:37,209 INFO L276 IsEmpty]: Start isEmpty. Operand 4485 states and 6621 transitions. [2025-03-16 20:32:37,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-16 20:32:37,209 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:32:37,210 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:32:37,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-16 20:32:37,210 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:32:37,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:32:37,210 INFO L85 PathProgramCache]: Analyzing trace with hash 308650038, now seen corresponding path program 1 times [2025-03-16 20:32:37,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:32:37,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143489895] [2025-03-16 20:32:37,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:32:37,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:32:37,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-16 20:32:37,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-16 20:32:37,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:32:37,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:32:37,319 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:32:37,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:32:37,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143489895] [2025-03-16 20:32:37,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143489895] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:32:37,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:32:37,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:32:37,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550980730] [2025-03-16 20:32:37,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:32:37,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:32:37,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:32:37,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:32:37,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:32:37,321 INFO L87 Difference]: Start difference. First operand 4485 states and 6621 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 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:32:37,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:32:37,359 INFO L93 Difference]: Finished difference Result 5569 states and 8123 transitions. [2025-03-16 20:32:37,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:32:37,359 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 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 97 [2025-03-16 20:32:37,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:32:37,365 INFO L225 Difference]: With dead ends: 5569 [2025-03-16 20:32:37,365 INFO L226 Difference]: Without dead ends: 3407 [2025-03-16 20:32:37,367 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:32:37,368 INFO L435 NwaCegarLoop]: 1575 mSDtfsCounter, 41 mSDsluCounter, 1507 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 3082 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:32:37,368 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 3082 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:32:37,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3407 states. [2025-03-16 20:32:37,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3407 to 3405. [2025-03-16 20:32:37,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3405 states, 3403 states have (on average 1.5004407875404056) internal successors, (5106), 3404 states have internal predecessors, (5106), 0 states have call successors, (0), 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:32:37,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3405 states to 3405 states and 5106 transitions. [2025-03-16 20:32:37,414 INFO L78 Accepts]: Start accepts. Automaton has 3405 states and 5106 transitions. Word has length 97 [2025-03-16 20:32:37,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:32:37,414 INFO L471 AbstractCegarLoop]: Abstraction has 3405 states and 5106 transitions. [2025-03-16 20:32:37,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 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:32:37,414 INFO L276 IsEmpty]: Start isEmpty. Operand 3405 states and 5106 transitions. [2025-03-16 20:32:37,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-16 20:32:37,415 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:32:37,415 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:32:37,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-16 20:32:37,415 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:32:37,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:32:37,416 INFO L85 PathProgramCache]: Analyzing trace with hash 892035823, now seen corresponding path program 1 times [2025-03-16 20:32:37,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:32:37,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611099559] [2025-03-16 20:32:37,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:32:37,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:32:37,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-16 20:32:37,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-16 20:32:37,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:32:37,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:32:38,400 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:32:38,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:32:38,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611099559] [2025-03-16 20:32:38,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611099559] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:32:38,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [528186333] [2025-03-16 20:32:38,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:32:38,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:32:38,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:32:38,403 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 20:32:38,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 20:32:38,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-16 20:32:38,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-16 20:32:38,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:32:38,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:32:38,532 INFO L256 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-16 20:32:38,536 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:32:39,012 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:32:39,016 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:32:39,797 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:32:39,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [528186333] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:32:39,797 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:32:39,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 27 [2025-03-16 20:32:39,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279884865] [2025-03-16 20:32:39,798 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:32:39,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-16 20:32:39,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:32:39,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-16 20:32:39,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=665, Unknown=0, NotChecked=0, Total=756 [2025-03-16 20:32:39,799 INFO L87 Difference]: Start difference. First operand 3405 states and 5106 transitions. Second operand has 28 states, 28 states have (on average 9.071428571428571) internal successors, (254), 27 states have internal predecessors, (254), 0 states have call successors, (0), 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:32:43,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:32:43,110 INFO L93 Difference]: Finished difference Result 8579 states and 12223 transitions. [2025-03-16 20:32:43,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-03-16 20:32:43,111 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 9.071428571428571) internal successors, (254), 27 states have internal predecessors, (254), 0 states have call successors, (0), 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 99 [2025-03-16 20:32:43,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:32:43,121 INFO L225 Difference]: With dead ends: 8579 [2025-03-16 20:32:43,122 INFO L226 Difference]: Without dead ends: 7497 [2025-03-16 20:32:43,125 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1163 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=935, Invalid=4177, Unknown=0, NotChecked=0, Total=5112 [2025-03-16 20:32:43,126 INFO L435 NwaCegarLoop]: 1529 mSDtfsCounter, 22248 mSDsluCounter, 6995 mSDsCounter, 0 mSdLazyCounter, 1417 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22248 SdHoareTripleChecker+Valid, 8524 SdHoareTripleChecker+Invalid, 1451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-16 20:32:43,127 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22248 Valid, 8524 Invalid, 1451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1417 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-16 20:32:43,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7497 states. [2025-03-16 20:32:43,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7497 to 7365. [2025-03-16 20:32:43,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7365 states, 7363 states have (on average 1.414640771424691) internal successors, (10416), 7364 states have internal predecessors, (10416), 0 states have call successors, (0), 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:32:43,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7365 states to 7365 states and 10416 transitions. [2025-03-16 20:32:43,262 INFO L78 Accepts]: Start accepts. Automaton has 7365 states and 10416 transitions. Word has length 99 [2025-03-16 20:32:43,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:32:43,262 INFO L471 AbstractCegarLoop]: Abstraction has 7365 states and 10416 transitions. [2025-03-16 20:32:43,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 9.071428571428571) internal successors, (254), 27 states have internal predecessors, (254), 0 states have call successors, (0), 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:32:43,262 INFO L276 IsEmpty]: Start isEmpty. Operand 7365 states and 10416 transitions. [2025-03-16 20:32:43,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-16 20:32:43,264 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:32:43,264 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:32:43,274 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 20:32:43,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-16 20:32:43,468 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:32:43,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:32:43,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1400023222, now seen corresponding path program 1 times [2025-03-16 20:32:43,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:32:43,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637116434] [2025-03-16 20:32:43,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:32:43,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:32:43,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-16 20:32:43,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-16 20:32:43,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:32:43,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:32:43,746 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:32:43,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:32:43,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637116434] [2025-03-16 20:32:43,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637116434] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:32:43,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1654647983] [2025-03-16 20:32:43,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:32:43,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:32:43,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:32:43,749 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 20:32:43,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 20:32:43,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-16 20:32:43,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-16 20:32:43,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:32:43,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:32:43,855 INFO L256 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-16 20:32:43,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:32:44,300 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:32:44,300 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:32:45,278 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:32:45,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1654647983] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:32:45,279 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:32:45,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 13] total 31 [2025-03-16 20:32:45,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249917546] [2025-03-16 20:32:45,279 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:32:45,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-16 20:32:45,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:32:45,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-16 20:32:45,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=803, Unknown=0, NotChecked=0, Total=930 [2025-03-16 20:32:45,280 INFO L87 Difference]: Start difference. First operand 7365 states and 10416 transitions. Second operand has 31 states, 31 states have (on average 8.870967741935484) internal successors, (275), 31 states have internal predecessors, (275), 0 states have call successors, (0), 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:32:47,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:32:47,664 INFO L93 Difference]: Finished difference Result 29099 states and 39823 transitions. [2025-03-16 20:32:47,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-03-16 20:32:47,665 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 8.870967741935484) internal successors, (275), 31 states have internal predecessors, (275), 0 states have call successors, (0), 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:32:47,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:32:47,690 INFO L225 Difference]: With dead ends: 29099 [2025-03-16 20:32:47,691 INFO L226 Difference]: Without dead ends: 24057 [2025-03-16 20:32:47,699 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1174 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=957, Invalid=4155, Unknown=0, NotChecked=0, Total=5112 [2025-03-16 20:32:47,699 INFO L435 NwaCegarLoop]: 1521 mSDtfsCounter, 22049 mSDsluCounter, 8297 mSDsCounter, 0 mSdLazyCounter, 1263 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22049 SdHoareTripleChecker+Valid, 9818 SdHoareTripleChecker+Invalid, 1313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 20:32:47,699 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22049 Valid, 9818 Invalid, 1313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1263 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 20:32:47,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24057 states. [2025-03-16 20:32:48,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24057 to 23685. [2025-03-16 20:32:48,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23685 states, 23683 states have (on average 1.338555081704176) internal successors, (31701), 23684 states have internal predecessors, (31701), 0 states have call successors, (0), 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:32:48,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23685 states to 23685 states and 31701 transitions. [2025-03-16 20:32:48,207 INFO L78 Accepts]: Start accepts. Automaton has 23685 states and 31701 transitions. Word has length 100 [2025-03-16 20:32:48,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:32:48,207 INFO L471 AbstractCegarLoop]: Abstraction has 23685 states and 31701 transitions. [2025-03-16 20:32:48,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 8.870967741935484) internal successors, (275), 31 states have internal predecessors, (275), 0 states have call successors, (0), 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:32:48,207 INFO L276 IsEmpty]: Start isEmpty. Operand 23685 states and 31701 transitions. [2025-03-16 20:32:48,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-16 20:32:48,210 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:32:48,210 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:32:48,217 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-16 20:32:48,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-16 20:32:48,410 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:32:48,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:32:48,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1429381284, now seen corresponding path program 1 times [2025-03-16 20:32:48,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:32:48,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067404889] [2025-03-16 20:32:48,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:32:48,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:32:48,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-16 20:32:48,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-16 20:32:48,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:32:48,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:32:48,704 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:32:48,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:32:48,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067404889] [2025-03-16 20:32:48,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067404889] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:32:48,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1863300125] [2025-03-16 20:32:48,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:32:48,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:32:48,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:32:48,706 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 20:32:48,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 20:32:48,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-16 20:32:48,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-16 20:32:48,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:32:48,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:32:48,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-16 20:32:48,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:32:49,195 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:32:49,195 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:32:49,781 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:32:49,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1863300125] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:32:49,782 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:32:49,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2025-03-16 20:32:49,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382116643] [2025-03-16 20:32:49,782 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:32:49,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-16 20:32:49,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:32:49,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-16 20:32:49,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=514, Unknown=0, NotChecked=0, Total=600 [2025-03-16 20:32:49,783 INFO L87 Difference]: Start difference. First operand 23685 states and 31701 transitions. Second operand has 25 states, 25 states have (on average 11.08) internal successors, (277), 24 states have internal predecessors, (277), 0 states have call successors, (0), 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:32:51,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:32:51,467 INFO L93 Difference]: Finished difference Result 55615 states and 73886 transitions. [2025-03-16 20:32:51,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-16 20:32:51,468 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 11.08) internal successors, (277), 24 states have internal predecessors, (277), 0 states have call successors, (0), 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 102 [2025-03-16 20:32:51,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:32:51,502 INFO L225 Difference]: With dead ends: 55615 [2025-03-16 20:32:51,502 INFO L226 Difference]: Without dead ends: 34253 [2025-03-16 20:32:51,513 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 407 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=487, Invalid=1769, Unknown=0, NotChecked=0, Total=2256 [2025-03-16 20:32:51,514 INFO L435 NwaCegarLoop]: 1539 mSDtfsCounter, 20490 mSDsluCounter, 6720 mSDsCounter, 0 mSdLazyCounter, 939 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20490 SdHoareTripleChecker+Valid, 8259 SdHoareTripleChecker+Invalid, 967 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 939 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 20:32:51,514 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20490 Valid, 8259 Invalid, 967 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 939 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 20:32:51,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34253 states. [2025-03-16 20:32:52,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34253 to 31485. [2025-03-16 20:32:52,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31485 states, 31483 states have (on average 1.3251913731220024) internal successors, (41721), 31484 states have internal predecessors, (41721), 0 states have call successors, (0), 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:32:52,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31485 states to 31485 states and 41721 transitions. [2025-03-16 20:32:52,373 INFO L78 Accepts]: Start accepts. Automaton has 31485 states and 41721 transitions. Word has length 102 [2025-03-16 20:32:52,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:32:52,373 INFO L471 AbstractCegarLoop]: Abstraction has 31485 states and 41721 transitions. [2025-03-16 20:32:52,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 11.08) internal successors, (277), 24 states have internal predecessors, (277), 0 states have call successors, (0), 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:32:52,373 INFO L276 IsEmpty]: Start isEmpty. Operand 31485 states and 41721 transitions. [2025-03-16 20:32:52,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-16 20:32:52,376 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:32:52,376 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:32:52,382 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-16 20:32:52,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:32:52,576 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:32:52,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:32:52,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1976955942, now seen corresponding path program 1 times [2025-03-16 20:32:52,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:32:52,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529313183] [2025-03-16 20:32:52,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:32:52,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:32:52,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-16 20:32:52,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-16 20:32:52,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:32:52,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:32:52,820 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:32:52,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:32:52,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529313183] [2025-03-16 20:32:52,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529313183] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:32:52,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [650465991] [2025-03-16 20:32:52,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:32:52,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:32:52,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:32:52,822 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 20:32:52,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-16 20:32:52,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-16 20:32:52,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-16 20:32:52,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:32:52,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:32:52,942 INFO L256 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-16 20:32:52,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:32:53,224 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:32:53,224 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:32:53,806 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:32:53,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [650465991] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:32:53,806 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:32:53,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2025-03-16 20:32:53,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968949744] [2025-03-16 20:32:53,806 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:32:53,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-16 20:32:53,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:32:53,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-16 20:32:53,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2025-03-16 20:32:53,807 INFO L87 Difference]: Start difference. First operand 31485 states and 41721 transitions. Second operand has 21 states, 21 states have (on average 10.333333333333334) internal successors, (217), 20 states have internal predecessors, (217), 0 states have call successors, (0), 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:32:55,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:32:55,548 INFO L93 Difference]: Finished difference Result 89811 states and 117924 transitions. [2025-03-16 20:32:55,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 20:32:55,552 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 10.333333333333334) internal successors, (217), 20 states have internal predecessors, (217), 0 states have call successors, (0), 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 103 [2025-03-16 20:32:55,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:32:55,622 INFO L225 Difference]: With dead ends: 89811 [2025-03-16 20:32:55,622 INFO L226 Difference]: Without dead ends: 60649 [2025-03-16 20:32:55,643 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=215, Invalid=597, Unknown=0, NotChecked=0, Total=812 [2025-03-16 20:32:55,644 INFO L435 NwaCegarLoop]: 1534 mSDtfsCounter, 10764 mSDsluCounter, 4960 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10764 SdHoareTripleChecker+Valid, 6494 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:32:55,644 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10764 Valid, 6494 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 485 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 20:32:55,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60649 states. [2025-03-16 20:32:57,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60649 to 60645. [2025-03-16 20:32:57,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60645 states, 60643 states have (on average 1.3103078673548472) internal successors, (79461), 60644 states have internal predecessors, (79461), 0 states have call successors, (0), 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:32:57,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60645 states to 60645 states and 79461 transitions. [2025-03-16 20:32:57,342 INFO L78 Accepts]: Start accepts. Automaton has 60645 states and 79461 transitions. Word has length 103 [2025-03-16 20:32:57,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:32:57,343 INFO L471 AbstractCegarLoop]: Abstraction has 60645 states and 79461 transitions. [2025-03-16 20:32:57,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 10.333333333333334) internal successors, (217), 20 states have internal predecessors, (217), 0 states have call successors, (0), 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:32:57,343 INFO L276 IsEmpty]: Start isEmpty. Operand 60645 states and 79461 transitions. [2025-03-16 20:32:57,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-16 20:32:57,346 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:32:57,346 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:32:57,353 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-16 20:32:57,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-16 20:32:57,546 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:32:57,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:32:57,547 INFO L85 PathProgramCache]: Analyzing trace with hash 2050371838, now seen corresponding path program 1 times [2025-03-16 20:32:57,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:32:57,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705029832] [2025-03-16 20:32:57,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:32:57,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:32:57,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-16 20:32:57,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-16 20:32:57,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:32:57,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:32:58,228 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:32:58,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:32:58,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705029832] [2025-03-16 20:32:58,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705029832] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:32:58,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1583441695] [2025-03-16 20:32:58,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:32:58,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:32:58,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:32:58,231 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 20:32:58,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-16 20:32:58,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-16 20:32:58,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-16 20:32:58,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:32:58,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:32:58,359 INFO L256 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-16 20:32:58,363 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:32:59,110 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:32:59,110 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:33:00,018 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:33:00,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1583441695] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:33:00,018 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:33:00,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 31 [2025-03-16 20:33:00,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501449282] [2025-03-16 20:33:00,018 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:33:00,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-16 20:33:00,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:33:00,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-16 20:33:00,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=821, Unknown=0, NotChecked=0, Total=930 [2025-03-16 20:33:00,020 INFO L87 Difference]: Start difference. First operand 60645 states and 79461 transitions. Second operand has 31 states, 31 states have (on average 9.129032258064516) internal successors, (283), 31 states have internal predecessors, (283), 0 states have call successors, (0), 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:33:07,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:33:07,381 INFO L93 Difference]: Finished difference Result 256989 states and 333437 transitions. [2025-03-16 20:33:07,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-16 20:33:07,382 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 9.129032258064516) internal successors, (283), 31 states have internal predecessors, (283), 0 states have call successors, (0), 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 104 [2025-03-16 20:33:07,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:33:07,693 INFO L225 Difference]: With dead ends: 256989 [2025-03-16 20:33:07,693 INFO L226 Difference]: Without dead ends: 241435 [2025-03-16 20:33:07,745 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 487 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=519, Invalid=2133, Unknown=0, NotChecked=0, Total=2652 [2025-03-16 20:33:07,745 INFO L435 NwaCegarLoop]: 1533 mSDtfsCounter, 18417 mSDsluCounter, 13968 mSDsCounter, 0 mSdLazyCounter, 931 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18417 SdHoareTripleChecker+Valid, 15501 SdHoareTripleChecker+Invalid, 964 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 931 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 20:33:07,745 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18417 Valid, 15501 Invalid, 964 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 931 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 20:33:07,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241435 states. [2025-03-16 20:33:11,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241435 to 97877. [2025-03-16 20:33:11,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97877 states, 97875 states have (on average 1.2963984674329503) internal successors, (126885), 97876 states have internal predecessors, (126885), 0 states have call successors, (0), 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:33:11,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97877 states to 97877 states and 126885 transitions. [2025-03-16 20:33:11,420 INFO L78 Accepts]: Start accepts. Automaton has 97877 states and 126885 transitions. Word has length 104 [2025-03-16 20:33:11,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:33:11,421 INFO L471 AbstractCegarLoop]: Abstraction has 97877 states and 126885 transitions. [2025-03-16 20:33:11,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 9.129032258064516) internal successors, (283), 31 states have internal predecessors, (283), 0 states have call successors, (0), 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:33:11,421 INFO L276 IsEmpty]: Start isEmpty. Operand 97877 states and 126885 transitions. [2025-03-16 20:33:11,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-16 20:33:11,425 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:33:11,425 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:33:11,431 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-16 20:33:11,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:33:11,626 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:33:11,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:33:11,626 INFO L85 PathProgramCache]: Analyzing trace with hash -967938530, now seen corresponding path program 1 times [2025-03-16 20:33:11,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:33:11,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795130814] [2025-03-16 20:33:11,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:33:11,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:33:11,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-16 20:33:11,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-16 20:33:11,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:33:11,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:33:12,150 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:33:12,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:33:12,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795130814] [2025-03-16 20:33:12,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795130814] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:33:12,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [328579995] [2025-03-16 20:33:12,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:33:12,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:33:12,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:33:12,153 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 20:33:12,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-16 20:33:12,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-16 20:33:12,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-16 20:33:12,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:33:12,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:33:12,280 INFO L256 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-16 20:33:12,281 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:33:13,042 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:33:13,042 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:33:13,696 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:33:13,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [328579995] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:33:13,697 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:33:13,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 32 [2025-03-16 20:33:13,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788747372] [2025-03-16 20:33:13,697 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:33:13,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-16 20:33:13,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:33:13,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-16 20:33:13,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=892, Unknown=0, NotChecked=0, Total=992 [2025-03-16 20:33:13,698 INFO L87 Difference]: Start difference. First operand 97877 states and 126885 transitions. Second operand has 32 states, 32 states have (on average 8.6875) internal successors, (278), 32 states have internal predecessors, (278), 0 states have call successors, (0), 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:33:20,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:33:20,019 INFO L93 Difference]: Finished difference Result 137573 states and 178205 transitions. [2025-03-16 20:33:20,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-03-16 20:33:20,020 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 8.6875) internal successors, (278), 32 states have internal predecessors, (278), 0 states have call successors, (0), 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 104 [2025-03-16 20:33:20,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:33:20,116 INFO L225 Difference]: With dead ends: 137573 [2025-03-16 20:33:20,117 INFO L226 Difference]: Without dead ends: 97059 [2025-03-16 20:33:20,135 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1351 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1190, Invalid=4510, Unknown=0, NotChecked=0, Total=5700 [2025-03-16 20:33:20,136 INFO L435 NwaCegarLoop]: 1544 mSDtfsCounter, 14237 mSDsluCounter, 23057 mSDsCounter, 0 mSdLazyCounter, 1767 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14237 SdHoareTripleChecker+Valid, 24601 SdHoareTripleChecker+Invalid, 1817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 20:33:20,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14237 Valid, 24601 Invalid, 1817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1767 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 20:33:20,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97059 states. [2025-03-16 20:33:22,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97059 to 85845. [2025-03-16 20:33:22,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85845 states, 85843 states have (on average 1.2933960835478724) internal successors, (111029), 85844 states have internal predecessors, (111029), 0 states have call successors, (0), 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:33:23,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85845 states to 85845 states and 111029 transitions. [2025-03-16 20:33:23,098 INFO L78 Accepts]: Start accepts. Automaton has 85845 states and 111029 transitions. Word has length 104 [2025-03-16 20:33:23,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:33:23,099 INFO L471 AbstractCegarLoop]: Abstraction has 85845 states and 111029 transitions. [2025-03-16 20:33:23,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 8.6875) internal successors, (278), 32 states have internal predecessors, (278), 0 states have call successors, (0), 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:33:23,099 INFO L276 IsEmpty]: Start isEmpty. Operand 85845 states and 111029 transitions. [2025-03-16 20:33:23,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-16 20:33:23,101 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:33:23,101 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:33:23,108 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-16 20:33:23,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:33:23,302 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:33:23,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:33:23,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1414477630, now seen corresponding path program 1 times [2025-03-16 20:33:23,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:33:23,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780221834] [2025-03-16 20:33:23,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:33:23,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:33:23,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-16 20:33:23,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-16 20:33:23,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:33:23,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:33:23,759 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:33:23,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:33:23,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780221834] [2025-03-16 20:33:23,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780221834] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:33:23,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [55498045] [2025-03-16 20:33:23,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:33:23,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:33:23,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:33:23,762 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 20:33:23,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-16 20:33:23,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-16 20:33:23,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-16 20:33:23,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:33:23,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:33:23,882 INFO L256 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-16 20:33:23,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:33:24,516 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:33:24,516 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:33:25,451 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:33:25,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [55498045] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:33:25,451 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:33:25,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 16] total 36 [2025-03-16 20:33:25,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257334254] [2025-03-16 20:33:25,452 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:33:25,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-16 20:33:25,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:33:25,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-16 20:33:25,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1096, Unknown=0, NotChecked=0, Total=1260 [2025-03-16 20:33:25,453 INFO L87 Difference]: Start difference. First operand 85845 states and 111029 transitions. Second operand has 36 states, 36 states have (on average 7.583333333333333) internal successors, (273), 36 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)