./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-5.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-5.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4639c6b0fb22706997cf521ef330c95d8a0fb320eefb7d80395f3064e0e7914f --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 15:23:06,198 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 15:23:06,253 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 15:23:06,258 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 15:23:06,258 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 15:23:06,271 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 15:23:06,271 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 15:23:06,271 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 15:23:06,271 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 15:23:06,271 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 15:23:06,271 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 15:23:06,271 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 15:23:06,272 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 15:23:06,272 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 15:23:06,272 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 15:23:06,272 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 15:23:06,272 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 15:23:06,272 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 15:23:06,272 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 15:23:06,272 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 15:23:06,272 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 15:23:06,272 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 15:23:06,272 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 15:23:06,272 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 15:23:06,272 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 15:23:06,272 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 15:23:06,272 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 15:23:06,272 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 15:23:06,272 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 15:23:06,273 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 15:23:06,273 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 15:23:06,273 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 15:23:06,273 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:23:06,273 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 15:23:06,273 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 15:23:06,273 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 15:23:06,273 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 15:23:06,273 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 15:23:06,273 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 15:23:06,273 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 15:23:06,273 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 15:23:06,273 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 15:23:06,273 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 15:23:06,273 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 -> 4639c6b0fb22706997cf521ef330c95d8a0fb320eefb7d80395f3064e0e7914f [2025-03-08 15:23:06,504 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 15:23:06,510 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 15:23:06,513 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 15:23:06,513 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 15:23:06,514 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 15:23:06,514 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-5.i [2025-03-08 15:23:07,607 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1aa18bb67/4ab4abc69ea24337901262f2e1a52bca/FLAGf888811c8 [2025-03-08 15:23:07,943 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 15:23:07,944 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-5.i [2025-03-08 15:23:07,952 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1aa18bb67/4ab4abc69ea24337901262f2e1a52bca/FLAGf888811c8 [2025-03-08 15:23:08,196 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1aa18bb67/4ab4abc69ea24337901262f2e1a52bca [2025-03-08 15:23:08,198 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 15:23:08,199 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 15:23:08,202 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 15:23:08,202 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 15:23:08,205 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 15:23:08,205 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:23:08" (1/1) ... [2025-03-08 15:23:08,207 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7538df31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:23:08, skipping insertion in model container [2025-03-08 15:23:08,207 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:23:08" (1/1) ... [2025-03-08 15:23:08,233 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 15:23:08,339 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-5.i[915,928] [2025-03-08 15:23:08,474 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:23:08,486 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 15:23:08,493 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-5.i[915,928] [2025-03-08 15:23:08,544 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:23:08,564 INFO L204 MainTranslator]: Completed translation [2025-03-08 15:23:08,565 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:23:08 WrapperNode [2025-03-08 15:23:08,565 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 15:23:08,566 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 15:23:08,566 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 15:23:08,566 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 15:23:08,571 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:23:08" (1/1) ... [2025-03-08 15:23:08,584 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:23:08" (1/1) ... [2025-03-08 15:23:08,640 INFO L138 Inliner]: procedures = 26, calls = 48, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 412 [2025-03-08 15:23:08,641 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 15:23:08,641 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 15:23:08,642 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 15:23:08,642 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 15:23:08,647 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:23:08" (1/1) ... [2025-03-08 15:23:08,648 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:23:08" (1/1) ... [2025-03-08 15:23:08,663 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:23:08" (1/1) ... [2025-03-08 15:23:08,699 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-08 15:23:08,699 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:23:08" (1/1) ... [2025-03-08 15:23:08,699 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:23:08" (1/1) ... [2025-03-08 15:23:08,718 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:23:08" (1/1) ... [2025-03-08 15:23:08,726 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:23:08" (1/1) ... [2025-03-08 15:23:08,739 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:23:08" (1/1) ... [2025-03-08 15:23:08,746 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:23:08" (1/1) ... [2025-03-08 15:23:08,757 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 15:23:08,758 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 15:23:08,758 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 15:23:08,759 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 15:23:08,759 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:23:08" (1/1) ... [2025-03-08 15:23:08,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:23:08,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:23:08,790 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-08 15:23:08,796 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-08 15:23:08,810 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 15:23:08,810 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 15:23:08,810 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 15:23:08,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 15:23:08,811 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 15:23:08,811 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 15:23:08,896 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 15:23:08,897 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 15:23:09,490 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L346: havoc property_#t~ite33#1;havoc property_#t~bitwise32#1;havoc property_#t~short34#1;havoc property_#t~bitwise35#1;havoc property_#t~bitwise36#1;havoc property_#t~short37#1;havoc property_#t~ite39#1;havoc property_#t~bitwise38#1;havoc property_#t~short40#1; [2025-03-08 15:23:09,544 INFO L? ?]: Removed 49 outVars from TransFormulas that were not future-live. [2025-03-08 15:23:09,545 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 15:23:09,569 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 15:23:09,570 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 15:23:09,571 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:23:09 BoogieIcfgContainer [2025-03-08 15:23:09,571 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 15:23:09,573 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 15:23:09,573 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 15:23:09,576 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 15:23:09,577 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 03:23:08" (1/3) ... [2025-03-08 15:23:09,577 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@595e23a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:23:09, skipping insertion in model container [2025-03-08 15:23:09,578 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:23:08" (2/3) ... [2025-03-08 15:23:09,578 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@595e23a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:23:09, skipping insertion in model container [2025-03-08 15:23:09,578 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:23:09" (3/3) ... [2025-03-08 15:23:09,579 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-5.i [2025-03-08 15:23:09,590 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 15:23:09,593 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount250_file-5.i that has 2 procedures, 168 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 15:23:09,645 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 15:23:09,655 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;@cb43b82, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 15:23:09,656 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 15:23:09,661 INFO L276 IsEmpty]: Start isEmpty. Operand has 168 states, 130 states have (on average 1.5384615384615385) internal successors, (200), 131 states have internal predecessors, (200), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-03-08 15:23:09,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2025-03-08 15:23:09,677 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:23:09,678 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:23:09,678 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:23:09,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:23:09,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1016587399, now seen corresponding path program 1 times [2025-03-08 15:23:09,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:23:09,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150785962] [2025-03-08 15:23:09,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:23:09,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:23:09,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 249 statements into 1 equivalence classes. [2025-03-08 15:23:09,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 249 of 249 statements. [2025-03-08 15:23:09,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:23:09,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:23:10,064 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 2312 trivial. 0 not checked. [2025-03-08 15:23:10,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:23:10,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150785962] [2025-03-08 15:23:10,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150785962] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:23:10,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [427646747] [2025-03-08 15:23:10,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:23:10,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:23:10,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:23:10,068 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-08 15:23:10,069 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-08 15:23:10,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 249 statements into 1 equivalence classes. [2025-03-08 15:23:10,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 249 of 249 statements. [2025-03-08 15:23:10,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:23:10,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:23:10,264 INFO L256 TraceCheckSpWp]: Trace formula consists of 608 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 15:23:10,274 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:23:10,297 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 2312 trivial. 0 not checked. [2025-03-08 15:23:10,297 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 15:23:10,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [427646747] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:23:10,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 15:23:10,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 15:23:10,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650120144] [2025-03-08 15:23:10,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:23:10,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 15:23:10,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:23:10,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 15:23:10,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 15:23:10,324 INFO L87 Difference]: Start difference. First operand has 168 states, 130 states have (on average 1.5384615384615385) internal successors, (200), 131 states have internal predecessors, (200), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) Second operand has 2 states, 2 states have (on average 39.5) internal successors, (79), 2 states have internal predecessors, (79), 2 states have call successors, (35), 2 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 2 states have call successors, (35) [2025-03-08 15:23:10,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:23:10,361 INFO L93 Difference]: Finished difference Result 330 states and 570 transitions. [2025-03-08 15:23:10,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 15:23:10,363 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 39.5) internal successors, (79), 2 states have internal predecessors, (79), 2 states have call successors, (35), 2 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 2 states have call successors, (35) Word has length 249 [2025-03-08 15:23:10,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:23:10,368 INFO L225 Difference]: With dead ends: 330 [2025-03-08 15:23:10,368 INFO L226 Difference]: Without dead ends: 165 [2025-03-08 15:23:10,371 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 250 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-08 15:23:10,373 INFO L435 NwaCegarLoop]: 255 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 15:23:10,373 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 255 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:23:10,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2025-03-08 15:23:10,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2025-03-08 15:23:10,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 128 states have (on average 1.5078125) internal successors, (193), 128 states have internal predecessors, (193), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-03-08 15:23:10,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 263 transitions. [2025-03-08 15:23:10,417 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 263 transitions. Word has length 249 [2025-03-08 15:23:10,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:23:10,418 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 263 transitions. [2025-03-08 15:23:10,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 39.5) internal successors, (79), 2 states have internal predecessors, (79), 2 states have call successors, (35), 2 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 2 states have call successors, (35) [2025-03-08 15:23:10,418 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 263 transitions. [2025-03-08 15:23:10,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2025-03-08 15:23:10,421 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:23:10,421 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:23:10,428 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-08 15:23:10,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 15:23:10,622 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:23:10,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:23:10,622 INFO L85 PathProgramCache]: Analyzing trace with hash -2075730215, now seen corresponding path program 1 times [2025-03-08 15:23:10,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:23:10,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135797531] [2025-03-08 15:23:10,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:23:10,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:23:10,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 249 statements into 1 equivalence classes. [2025-03-08 15:23:10,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 249 of 249 statements. [2025-03-08 15:23:10,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:23:10,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:23:11,296 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2025-03-08 15:23:11,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:23:11,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135797531] [2025-03-08 15:23:11,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135797531] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:23:11,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:23:11,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 15:23:11,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510873648] [2025-03-08 15:23:11,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:23:11,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 15:23:11,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:23:11,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 15:23:11,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:23:11,301 INFO L87 Difference]: Start difference. First operand 165 states and 263 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-03-08 15:23:11,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:23:11,635 INFO L93 Difference]: Finished difference Result 548 states and 885 transitions. [2025-03-08 15:23:11,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 15:23:11,636 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 249 [2025-03-08 15:23:11,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:23:11,640 INFO L225 Difference]: With dead ends: 548 [2025-03-08 15:23:11,642 INFO L226 Difference]: Without dead ends: 386 [2025-03-08 15:23:11,644 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-08 15:23:11,646 INFO L435 NwaCegarLoop]: 335 mSDtfsCounter, 292 mSDsluCounter, 736 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 1071 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 15:23:11,646 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 1071 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 15:23:11,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2025-03-08 15:23:11,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 243. [2025-03-08 15:23:11,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 170 states have (on average 1.4352941176470588) internal successors, (244), 170 states have internal predecessors, (244), 70 states have call successors, (70), 2 states have call predecessors, (70), 2 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2025-03-08 15:23:11,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 384 transitions. [2025-03-08 15:23:11,683 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 384 transitions. Word has length 249 [2025-03-08 15:23:11,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:23:11,685 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 384 transitions. [2025-03-08 15:23:11,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-03-08 15:23:11,685 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 384 transitions. [2025-03-08 15:23:11,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2025-03-08 15:23:11,690 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:23:11,690 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:23:11,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 15:23:11,690 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:23:11,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:23:11,691 INFO L85 PathProgramCache]: Analyzing trace with hash 876136828, now seen corresponding path program 1 times [2025-03-08 15:23:11,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:23:11,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118019154] [2025-03-08 15:23:11,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:23:11,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:23:11,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 249 statements into 1 equivalence classes. [2025-03-08 15:23:11,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 249 of 249 statements. [2025-03-08 15:23:11,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:23:11,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:23:12,336 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2025-03-08 15:23:12,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:23:12,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118019154] [2025-03-08 15:23:12,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118019154] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:23:12,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:23:12,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 15:23:12,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094736613] [2025-03-08 15:23:12,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:23:12,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 15:23:12,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:23:12,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 15:23:12,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 15:23:12,341 INFO L87 Difference]: Start difference. First operand 243 states and 384 transitions. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-03-08 15:23:13,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:23:13,023 INFO L93 Difference]: Finished difference Result 568 states and 907 transitions. [2025-03-08 15:23:13,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 15:23:13,024 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), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 249 [2025-03-08 15:23:13,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:23:13,027 INFO L225 Difference]: With dead ends: 568 [2025-03-08 15:23:13,028 INFO L226 Difference]: Without dead ends: 406 [2025-03-08 15:23:13,028 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2025-03-08 15:23:13,029 INFO L435 NwaCegarLoop]: 284 mSDtfsCounter, 543 mSDsluCounter, 1193 mSDsCounter, 0 mSdLazyCounter, 595 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 543 SdHoareTripleChecker+Valid, 1477 SdHoareTripleChecker+Invalid, 711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 15:23:13,029 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [543 Valid, 1477 Invalid, 711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 595 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 15:23:13,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2025-03-08 15:23:13,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 343. [2025-03-08 15:23:13,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 270 states have (on average 1.5148148148148148) internal successors, (409), 270 states have internal predecessors, (409), 70 states have call successors, (70), 2 states have call predecessors, (70), 2 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2025-03-08 15:23:13,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 549 transitions. [2025-03-08 15:23:13,067 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 549 transitions. Word has length 249 [2025-03-08 15:23:13,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:23:13,068 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 549 transitions. [2025-03-08 15:23:13,068 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), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-03-08 15:23:13,068 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 549 transitions. [2025-03-08 15:23:13,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2025-03-08 15:23:13,070 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:23:13,070 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:23:13,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 15:23:13,070 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:23:13,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:23:13,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1537596229, now seen corresponding path program 1 times [2025-03-08 15:23:13,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:23:13,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668068271] [2025-03-08 15:23:13,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:23:13,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:23:13,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 250 statements into 1 equivalence classes. [2025-03-08 15:23:13,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 250 of 250 statements. [2025-03-08 15:23:13,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:23:13,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:23:13,550 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2025-03-08 15:23:13,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:23:13,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668068271] [2025-03-08 15:23:13,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668068271] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:23:13,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:23:13,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 15:23:13,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544493951] [2025-03-08 15:23:13,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:23:13,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 15:23:13,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:23:13,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 15:23:13,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-08 15:23:13,552 INFO L87 Difference]: Start difference. First operand 343 states and 549 transitions. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-03-08 15:23:14,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:23:14,487 INFO L93 Difference]: Finished difference Result 744 states and 1193 transitions. [2025-03-08 15:23:14,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 15:23:14,488 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 250 [2025-03-08 15:23:14,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:23:14,491 INFO L225 Difference]: With dead ends: 744 [2025-03-08 15:23:14,491 INFO L226 Difference]: Without dead ends: 582 [2025-03-08 15:23:14,492 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2025-03-08 15:23:14,492 INFO L435 NwaCegarLoop]: 331 mSDtfsCounter, 653 mSDsluCounter, 1676 mSDsCounter, 0 mSdLazyCounter, 776 mSolverCounterSat, 185 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 653 SdHoareTripleChecker+Valid, 2007 SdHoareTripleChecker+Invalid, 961 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 185 IncrementalHoareTripleChecker+Valid, 776 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 15:23:14,493 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [653 Valid, 2007 Invalid, 961 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [185 Valid, 776 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 15:23:14,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2025-03-08 15:23:14,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 430. [2025-03-08 15:23:14,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 357 states have (on average 1.5602240896358543) internal successors, (557), 357 states have internal predecessors, (557), 70 states have call successors, (70), 2 states have call predecessors, (70), 2 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2025-03-08 15:23:14,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 697 transitions. [2025-03-08 15:23:14,528 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 697 transitions. Word has length 250 [2025-03-08 15:23:14,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:23:14,530 INFO L471 AbstractCegarLoop]: Abstraction has 430 states and 697 transitions. [2025-03-08 15:23:14,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-03-08 15:23:14,530 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 697 transitions. [2025-03-08 15:23:14,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2025-03-08 15:23:14,533 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:23:14,533 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:23:14,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 15:23:14,534 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:23:14,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:23:14,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1031890170, now seen corresponding path program 1 times [2025-03-08 15:23:14,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:23:14,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61473051] [2025-03-08 15:23:14,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:23:14,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:23:14,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 250 statements into 1 equivalence classes. [2025-03-08 15:23:14,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 250 of 250 statements. [2025-03-08 15:23:14,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:23:14,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:23:14,924 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2025-03-08 15:23:14,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:23:14,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61473051] [2025-03-08 15:23:14,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61473051] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:23:14,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:23:14,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:23:14,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891415083] [2025-03-08 15:23:14,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:23:14,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:23:14,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:23:14,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:23:14,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:23:14,926 INFO L87 Difference]: Start difference. First operand 430 states and 697 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-03-08 15:23:15,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:23:15,181 INFO L93 Difference]: Finished difference Result 1143 states and 1859 transitions. [2025-03-08 15:23:15,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:23:15,182 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 250 [2025-03-08 15:23:15,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:23:15,186 INFO L225 Difference]: With dead ends: 1143 [2025-03-08 15:23:15,187 INFO L226 Difference]: Without dead ends: 792 [2025-03-08 15:23:15,188 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:23:15,188 INFO L435 NwaCegarLoop]: 367 mSDtfsCounter, 344 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 838 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 15:23:15,189 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 838 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 15:23:15,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2025-03-08 15:23:15,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 690. [2025-03-08 15:23:15,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 690 states, 581 states have (on average 1.5559380378657488) internal successors, (904), 581 states have internal predecessors, (904), 105 states have call successors, (105), 3 states have call predecessors, (105), 3 states have return successors, (105), 105 states have call predecessors, (105), 105 states have call successors, (105) [2025-03-08 15:23:15,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 1114 transitions. [2025-03-08 15:23:15,242 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 1114 transitions. Word has length 250 [2025-03-08 15:23:15,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:23:15,243 INFO L471 AbstractCegarLoop]: Abstraction has 690 states and 1114 transitions. [2025-03-08 15:23:15,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-03-08 15:23:15,244 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 1114 transitions. [2025-03-08 15:23:15,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2025-03-08 15:23:15,246 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:23:15,247 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:23:15,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 15:23:15,247 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:23:15,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:23:15,247 INFO L85 PathProgramCache]: Analyzing trace with hash -1753601001, now seen corresponding path program 1 times [2025-03-08 15:23:15,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:23:15,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202357577] [2025-03-08 15:23:15,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:23:15,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:23:15,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 251 statements into 1 equivalence classes. [2025-03-08 15:23:15,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 251 of 251 statements. [2025-03-08 15:23:15,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:23:15,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:23:15,796 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2025-03-08 15:23:15,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:23:15,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202357577] [2025-03-08 15:23:15,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202357577] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:23:15,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:23:15,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 15:23:15,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847354803] [2025-03-08 15:23:15,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:23:15,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 15:23:15,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:23:15,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 15:23:15,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-08 15:23:15,798 INFO L87 Difference]: Start difference. First operand 690 states and 1114 transitions. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 2 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2025-03-08 15:23:16,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:23:16,453 INFO L93 Difference]: Finished difference Result 1480 states and 2372 transitions. [2025-03-08 15:23:16,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 15:23:16,453 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 2 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) Word has length 251 [2025-03-08 15:23:16,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:23:16,460 INFO L225 Difference]: With dead ends: 1480 [2025-03-08 15:23:16,460 INFO L226 Difference]: Without dead ends: 1073 [2025-03-08 15:23:16,461 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2025-03-08 15:23:16,462 INFO L435 NwaCegarLoop]: 217 mSDtfsCounter, 962 mSDsluCounter, 1054 mSDsCounter, 0 mSdLazyCounter, 569 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 962 SdHoareTripleChecker+Valid, 1271 SdHoareTripleChecker+Invalid, 730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 15:23:16,462 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [962 Valid, 1271 Invalid, 730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 569 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 15:23:16,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1073 states. [2025-03-08 15:23:16,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1073 to 756. [2025-03-08 15:23:16,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 756 states, 647 states have (on average 1.562596599690881) internal successors, (1011), 647 states have internal predecessors, (1011), 105 states have call successors, (105), 3 states have call predecessors, (105), 3 states have return successors, (105), 105 states have call predecessors, (105), 105 states have call successors, (105) [2025-03-08 15:23:16,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 756 states to 756 states and 1221 transitions. [2025-03-08 15:23:16,509 INFO L78 Accepts]: Start accepts. Automaton has 756 states and 1221 transitions. Word has length 251 [2025-03-08 15:23:16,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:23:16,509 INFO L471 AbstractCegarLoop]: Abstraction has 756 states and 1221 transitions. [2025-03-08 15:23:16,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 2 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2025-03-08 15:23:16,510 INFO L276 IsEmpty]: Start isEmpty. Operand 756 states and 1221 transitions. [2025-03-08 15:23:16,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2025-03-08 15:23:16,516 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:23:16,516 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:23:16,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 15:23:16,516 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:23:16,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:23:16,517 INFO L85 PathProgramCache]: Analyzing trace with hash -915081140, now seen corresponding path program 1 times [2025-03-08 15:23:16,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:23:16,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485275277] [2025-03-08 15:23:16,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:23:16,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:23:16,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 251 statements into 1 equivalence classes. [2025-03-08 15:23:16,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 251 of 251 statements. [2025-03-08 15:23:16,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:23:16,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:23:16,610 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2025-03-08 15:23:16,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:23:16,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485275277] [2025-03-08 15:23:16,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485275277] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:23:16,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:23:16,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:23:16,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768909105] [2025-03-08 15:23:16,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:23:16,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:23:16,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:23:16,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:23:16,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:23:16,612 INFO L87 Difference]: Start difference. First operand 756 states and 1221 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-03-08 15:23:16,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:23:16,696 INFO L93 Difference]: Finished difference Result 1583 states and 2536 transitions. [2025-03-08 15:23:16,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:23:16,696 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 251 [2025-03-08 15:23:16,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:23:16,702 INFO L225 Difference]: With dead ends: 1583 [2025-03-08 15:23:16,702 INFO L226 Difference]: Without dead ends: 1176 [2025-03-08 15:23:16,704 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-08 15:23:16,704 INFO L435 NwaCegarLoop]: 307 mSDtfsCounter, 204 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:23:16,705 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 537 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:23:16,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2025-03-08 15:23:16,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 889. [2025-03-08 15:23:16,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 889 states, 780 states have (on average 1.5602564102564103) internal successors, (1217), 780 states have internal predecessors, (1217), 105 states have call successors, (105), 3 states have call predecessors, (105), 3 states have return successors, (105), 105 states have call predecessors, (105), 105 states have call successors, (105) [2025-03-08 15:23:16,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 889 states and 1427 transitions. [2025-03-08 15:23:16,757 INFO L78 Accepts]: Start accepts. Automaton has 889 states and 1427 transitions. Word has length 251 [2025-03-08 15:23:16,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:23:16,758 INFO L471 AbstractCegarLoop]: Abstraction has 889 states and 1427 transitions. [2025-03-08 15:23:16,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-03-08 15:23:16,758 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 1427 transitions. [2025-03-08 15:23:16,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2025-03-08 15:23:16,762 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:23:16,762 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:23:16,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 15:23:16,762 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:23:16,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:23:16,763 INFO L85 PathProgramCache]: Analyzing trace with hash 2026576459, now seen corresponding path program 1 times [2025-03-08 15:23:16,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:23:16,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453072552] [2025-03-08 15:23:16,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:23:16,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:23:16,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 251 statements into 1 equivalence classes. [2025-03-08 15:23:16,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 251 of 251 statements. [2025-03-08 15:23:16,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:23:16,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:23:17,101 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2025-03-08 15:23:17,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:23:17,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453072552] [2025-03-08 15:23:17,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453072552] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:23:17,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:23:17,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:23:17,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745773256] [2025-03-08 15:23:17,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:23:17,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:23:17,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:23:17,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:23:17,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:23:17,105 INFO L87 Difference]: Start difference. First operand 889 states and 1427 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-03-08 15:23:17,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:23:17,332 INFO L93 Difference]: Finished difference Result 2421 states and 3895 transitions. [2025-03-08 15:23:17,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:23:17,332 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 251 [2025-03-08 15:23:17,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:23:17,342 INFO L225 Difference]: With dead ends: 2421 [2025-03-08 15:23:17,343 INFO L226 Difference]: Without dead ends: 1974 [2025-03-08 15:23:17,346 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:23:17,346 INFO L435 NwaCegarLoop]: 241 mSDtfsCounter, 391 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 656 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 15:23:17,346 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 656 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 15:23:17,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1974 states. [2025-03-08 15:23:17,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1974 to 1550. [2025-03-08 15:23:17,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1550 states, 1403 states have (on average 1.5901639344262295) internal successors, (2231), 1405 states have internal predecessors, (2231), 141 states have call successors, (141), 5 states have call predecessors, (141), 5 states have return successors, (141), 139 states have call predecessors, (141), 141 states have call successors, (141) [2025-03-08 15:23:17,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1550 states to 1550 states and 2513 transitions. [2025-03-08 15:23:17,442 INFO L78 Accepts]: Start accepts. Automaton has 1550 states and 2513 transitions. Word has length 251 [2025-03-08 15:23:17,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:23:17,443 INFO L471 AbstractCegarLoop]: Abstraction has 1550 states and 2513 transitions. [2025-03-08 15:23:17,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-03-08 15:23:17,443 INFO L276 IsEmpty]: Start isEmpty. Operand 1550 states and 2513 transitions. [2025-03-08 15:23:17,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2025-03-08 15:23:17,447 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:23:17,447 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:23:17,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 15:23:17,447 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:23:17,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:23:17,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1734677758, now seen corresponding path program 1 times [2025-03-08 15:23:17,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:23:17,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959094505] [2025-03-08 15:23:17,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:23:17,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:23:17,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes. [2025-03-08 15:23:17,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements. [2025-03-08 15:23:17,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:23:17,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:23:17,586 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2025-03-08 15:23:17,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:23:17,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959094505] [2025-03-08 15:23:17,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959094505] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:23:17,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:23:17,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:23:17,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986085993] [2025-03-08 15:23:17,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:23:17,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:23:17,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:23:17,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:23:17,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:23:17,587 INFO L87 Difference]: Start difference. First operand 1550 states and 2513 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-03-08 15:23:17,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:23:17,665 INFO L93 Difference]: Finished difference Result 2595 states and 4143 transitions. [2025-03-08 15:23:17,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:23:17,666 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 252 [2025-03-08 15:23:17,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:23:17,674 INFO L225 Difference]: With dead ends: 2595 [2025-03-08 15:23:17,674 INFO L226 Difference]: Without dead ends: 1879 [2025-03-08 15:23:17,676 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:23:17,676 INFO L435 NwaCegarLoop]: 251 mSDtfsCounter, 72 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 15:23:17,677 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 483 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:23:17,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1879 states. [2025-03-08 15:23:17,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1879 to 1873. [2025-03-08 15:23:17,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1873 states, 1701 states have (on average 1.569077013521458) internal successors, (2669), 1707 states have internal predecessors, (2669), 161 states have call successors, (161), 10 states have call predecessors, (161), 10 states have return successors, (161), 155 states have call predecessors, (161), 161 states have call successors, (161) [2025-03-08 15:23:17,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1873 states to 1873 states and 2991 transitions. [2025-03-08 15:23:17,740 INFO L78 Accepts]: Start accepts. Automaton has 1873 states and 2991 transitions. Word has length 252 [2025-03-08 15:23:17,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:23:17,741 INFO L471 AbstractCegarLoop]: Abstraction has 1873 states and 2991 transitions. [2025-03-08 15:23:17,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-03-08 15:23:17,741 INFO L276 IsEmpty]: Start isEmpty. Operand 1873 states and 2991 transitions. [2025-03-08 15:23:17,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2025-03-08 15:23:17,744 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:23:17,744 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:23:17,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 15:23:17,744 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:23:17,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:23:17,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1730142241, now seen corresponding path program 1 times [2025-03-08 15:23:17,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:23:17,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342367622] [2025-03-08 15:23:17,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:23:17,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:23:17,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes. [2025-03-08 15:23:17,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements. [2025-03-08 15:23:17,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:23:17,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:23:18,446 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2025-03-08 15:23:18,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:23:18,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342367622] [2025-03-08 15:23:18,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342367622] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:23:18,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:23:18,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 15:23:18,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244757558] [2025-03-08 15:23:18,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:23:18,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 15:23:18,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:23:18,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 15:23:18,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-08 15:23:18,447 INFO L87 Difference]: Start difference. First operand 1873 states and 2991 transitions. Second operand has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-03-08 15:23:19,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:23:19,678 INFO L93 Difference]: Finished difference Result 9818 states and 15332 transitions. [2025-03-08 15:23:19,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 15:23:19,679 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 252 [2025-03-08 15:23:19,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:23:19,711 INFO L225 Difference]: With dead ends: 9818 [2025-03-08 15:23:19,712 INFO L226 Difference]: Without dead ends: 8665 [2025-03-08 15:23:19,716 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2025-03-08 15:23:19,716 INFO L435 NwaCegarLoop]: 300 mSDtfsCounter, 1378 mSDsluCounter, 1112 mSDsCounter, 0 mSdLazyCounter, 644 mSolverCounterSat, 277 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1378 SdHoareTripleChecker+Valid, 1412 SdHoareTripleChecker+Invalid, 921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 277 IncrementalHoareTripleChecker+Valid, 644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 15:23:19,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1378 Valid, 1412 Invalid, 921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [277 Valid, 644 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 15:23:19,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8665 states. [2025-03-08 15:23:19,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8665 to 5306. [2025-03-08 15:23:19,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5306 states, 5025 states have (on average 1.5691542288557214) internal successors, (7885), 5039 states have internal predecessors, (7885), 261 states have call successors, (261), 19 states have call predecessors, (261), 19 states have return successors, (261), 247 states have call predecessors, (261), 261 states have call successors, (261) [2025-03-08 15:23:19,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5306 states to 5306 states and 8407 transitions. [2025-03-08 15:23:19,917 INFO L78 Accepts]: Start accepts. Automaton has 5306 states and 8407 transitions. Word has length 252 [2025-03-08 15:23:19,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:23:19,917 INFO L471 AbstractCegarLoop]: Abstraction has 5306 states and 8407 transitions. [2025-03-08 15:23:19,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-03-08 15:23:19,918 INFO L276 IsEmpty]: Start isEmpty. Operand 5306 states and 8407 transitions. [2025-03-08 15:23:19,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2025-03-08 15:23:19,926 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:23:19,926 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:23:19,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 15:23:19,927 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:23:19,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:23:19,927 INFO L85 PathProgramCache]: Analyzing trace with hash 83907513, now seen corresponding path program 1 times [2025-03-08 15:23:19,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:23:19,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896307483] [2025-03-08 15:23:19,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:23:19,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:23:19,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes. [2025-03-08 15:23:19,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements. [2025-03-08 15:23:19,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:23:19,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:23:20,251 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2025-03-08 15:23:20,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:23:20,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896307483] [2025-03-08 15:23:20,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896307483] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:23:20,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:23:20,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 15:23:20,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334200925] [2025-03-08 15:23:20,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:23:20,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 15:23:20,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:23:20,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 15:23:20,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 15:23:20,253 INFO L87 Difference]: Start difference. First operand 5306 states and 8407 transitions. Second operand has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 2 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2025-03-08 15:23:20,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:23:20,845 INFO L93 Difference]: Finished difference Result 9016 states and 14151 transitions. [2025-03-08 15:23:20,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 15:23:20,846 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 2 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) Word has length 252 [2025-03-08 15:23:20,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:23:20,866 INFO L225 Difference]: With dead ends: 9016 [2025-03-08 15:23:20,867 INFO L226 Difference]: Without dead ends: 5873 [2025-03-08 15:23:20,874 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-03-08 15:23:20,875 INFO L435 NwaCegarLoop]: 248 mSDtfsCounter, 292 mSDsluCounter, 1194 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 1442 SdHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 15:23:20,875 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 1442 Invalid, 537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 15:23:20,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5873 states. [2025-03-08 15:23:21,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5873 to 5354. [2025-03-08 15:23:21,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5354 states, 5073 states have (on average 1.5681056574019319) internal successors, (7955), 5087 states have internal predecessors, (7955), 261 states have call successors, (261), 19 states have call predecessors, (261), 19 states have return successors, (261), 247 states have call predecessors, (261), 261 states have call successors, (261) [2025-03-08 15:23:21,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5354 states to 5354 states and 8477 transitions. [2025-03-08 15:23:21,049 INFO L78 Accepts]: Start accepts. Automaton has 5354 states and 8477 transitions. Word has length 252 [2025-03-08 15:23:21,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:23:21,051 INFO L471 AbstractCegarLoop]: Abstraction has 5354 states and 8477 transitions. [2025-03-08 15:23:21,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 2 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2025-03-08 15:23:21,051 INFO L276 IsEmpty]: Start isEmpty. Operand 5354 states and 8477 transitions. [2025-03-08 15:23:21,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2025-03-08 15:23:21,058 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:23:21,058 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:23:21,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 15:23:21,059 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:23:21,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:23:21,060 INFO L85 PathProgramCache]: Analyzing trace with hash -552384513, now seen corresponding path program 1 times [2025-03-08 15:23:21,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:23:21,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645923775] [2025-03-08 15:23:21,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:23:21,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:23:21,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes. [2025-03-08 15:23:21,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements. [2025-03-08 15:23:21,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:23:21,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:23:21,664 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 66 proven. 36 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2025-03-08 15:23:21,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:23:21,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645923775] [2025-03-08 15:23:21,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645923775] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:23:21,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1591125028] [2025-03-08 15:23:21,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:23:21,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:23:21,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:23:21,670 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-08 15:23:21,672 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-08 15:23:21,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes. [2025-03-08 15:23:21,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements. [2025-03-08 15:23:21,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:23:21,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:23:21,850 INFO L256 TraceCheckSpWp]: Trace formula consists of 613 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-08 15:23:21,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:23:22,081 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 1134 proven. 36 refuted. 0 times theorem prover too weak. 1210 trivial. 0 not checked. [2025-03-08 15:23:22,082 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:23:22,373 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 66 proven. 36 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2025-03-08 15:23:22,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1591125028] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 15:23:22,373 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 15:23:22,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 13 [2025-03-08 15:23:22,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552697279] [2025-03-08 15:23:22,374 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 15:23:22,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 15:23:22,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:23:22,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 15:23:22,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-03-08 15:23:22,375 INFO L87 Difference]: Start difference. First operand 5354 states and 8477 transitions. Second operand has 13 states, 13 states have (on average 8.153846153846153) internal successors, (106), 13 states have internal predecessors, (106), 2 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (48), 2 states have call predecessors, (48), 2 states have call successors, (48) [2025-03-08 15:23:23,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:23:23,956 INFO L93 Difference]: Finished difference Result 10130 states and 15872 transitions. [2025-03-08 15:23:23,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-08 15:23:23,956 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 8.153846153846153) internal successors, (106), 13 states have internal predecessors, (106), 2 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (48), 2 states have call predecessors, (48), 2 states have call successors, (48) Word has length 252 [2025-03-08 15:23:23,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:23:23,987 INFO L225 Difference]: With dead ends: 10130 [2025-03-08 15:23:23,988 INFO L226 Difference]: Without dead ends: 7105 [2025-03-08 15:23:23,998 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 538 GetRequests, 502 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=313, Invalid=947, Unknown=0, NotChecked=0, Total=1260 [2025-03-08 15:23:23,999 INFO L435 NwaCegarLoop]: 292 mSDtfsCounter, 1926 mSDsluCounter, 1578 mSDsCounter, 0 mSdLazyCounter, 1042 mSolverCounterSat, 458 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1980 SdHoareTripleChecker+Valid, 1870 SdHoareTripleChecker+Invalid, 1500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 458 IncrementalHoareTripleChecker+Valid, 1042 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 15:23:23,999 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1980 Valid, 1870 Invalid, 1500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [458 Valid, 1042 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 15:23:24,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7105 states. [2025-03-08 15:23:24,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7105 to 6753. [2025-03-08 15:23:24,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6753 states, 6331 states have (on average 1.5458853261728005) internal successors, (9787), 6353 states have internal predecessors, (9787), 387 states have call successors, (387), 34 states have call predecessors, (387), 34 states have return successors, (387), 365 states have call predecessors, (387), 387 states have call successors, (387) [2025-03-08 15:23:24,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6753 states to 6753 states and 10561 transitions. [2025-03-08 15:23:24,230 INFO L78 Accepts]: Start accepts. Automaton has 6753 states and 10561 transitions. Word has length 252 [2025-03-08 15:23:24,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:23:24,230 INFO L471 AbstractCegarLoop]: Abstraction has 6753 states and 10561 transitions. [2025-03-08 15:23:24,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.153846153846153) internal successors, (106), 13 states have internal predecessors, (106), 2 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (48), 2 states have call predecessors, (48), 2 states have call successors, (48) [2025-03-08 15:23:24,230 INFO L276 IsEmpty]: Start isEmpty. Operand 6753 states and 10561 transitions. [2025-03-08 15:23:24,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2025-03-08 15:23:24,238 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:23:24,238 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:23:24,246 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 15:23:24,439 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,SelfDestructingSolverStorable11 [2025-03-08 15:23:24,439 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:23:24,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:23:24,439 INFO L85 PathProgramCache]: Analyzing trace with hash -520369768, now seen corresponding path program 1 times [2025-03-08 15:23:24,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:23:24,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006325721] [2025-03-08 15:23:24,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:23:24,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:23:24,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes. [2025-03-08 15:23:24,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements. [2025-03-08 15:23:24,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:23:24,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:23:24,859 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2025-03-08 15:23:24,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:23:24,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006325721] [2025-03-08 15:23:24,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006325721] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:23:24,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:23:24,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 15:23:24,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436405896] [2025-03-08 15:23:24,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:23:24,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 15:23:24,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:23:24,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 15:23:24,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 15:23:24,861 INFO L87 Difference]: Start difference. First operand 6753 states and 10561 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-03-08 15:23:25,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:23:25,407 INFO L93 Difference]: Finished difference Result 17788 states and 27472 transitions. [2025-03-08 15:23:25,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 15:23:25,407 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 252 [2025-03-08 15:23:25,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:23:25,435 INFO L225 Difference]: With dead ends: 17788 [2025-03-08 15:23:25,436 INFO L226 Difference]: Without dead ends: 12849 [2025-03-08 15:23:25,450 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-03-08 15:23:25,451 INFO L435 NwaCegarLoop]: 248 mSDtfsCounter, 651 mSDsluCounter, 962 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 651 SdHoareTripleChecker+Valid, 1210 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 15:23:25,452 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [651 Valid, 1210 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 15:23:25,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12849 states. [2025-03-08 15:23:25,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12849 to 11917. [2025-03-08 15:23:25,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11917 states, 11232 states have (on average 1.5319622507122508) internal successors, (17207), 11274 states have internal predecessors, (17207), 629 states have call successors, (629), 55 states have call predecessors, (629), 55 states have return successors, (629), 587 states have call predecessors, (629), 629 states have call successors, (629) [2025-03-08 15:23:25,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11917 states to 11917 states and 18465 transitions. [2025-03-08 15:23:25,811 INFO L78 Accepts]: Start accepts. Automaton has 11917 states and 18465 transitions. Word has length 252 [2025-03-08 15:23:25,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:23:25,812 INFO L471 AbstractCegarLoop]: Abstraction has 11917 states and 18465 transitions. [2025-03-08 15:23:25,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-03-08 15:23:25,813 INFO L276 IsEmpty]: Start isEmpty. Operand 11917 states and 18465 transitions. [2025-03-08 15:23:25,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2025-03-08 15:23:25,827 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:23:25,828 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:23:25,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 15:23:25,828 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:23:25,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:23:25,828 INFO L85 PathProgramCache]: Analyzing trace with hash -493026792, now seen corresponding path program 1 times [2025-03-08 15:23:25,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:23:25,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307078070] [2025-03-08 15:23:25,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:23:25,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:23:25,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes. [2025-03-08 15:23:26,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements. [2025-03-08 15:23:26,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:23:26,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:23:26,343 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 36 proven. 66 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2025-03-08 15:23:26,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:23:26,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307078070] [2025-03-08 15:23:26,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307078070] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:23:26,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1602689138] [2025-03-08 15:23:26,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:23:26,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:23:26,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:23:26,347 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-08 15:23:26,349 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-08 15:23:26,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes. [2025-03-08 15:23:26,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements. [2025-03-08 15:23:26,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:23:26,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:23:26,534 INFO L256 TraceCheckSpWp]: Trace formula consists of 606 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 15:23:26,539 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:23:26,716 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 1212 proven. 45 refuted. 0 times theorem prover too weak. 1123 trivial. 0 not checked. [2025-03-08 15:23:26,717 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:23:26,949 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 57 proven. 45 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2025-03-08 15:23:26,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1602689138] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 15:23:26,949 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 15:23:26,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 11 [2025-03-08 15:23:26,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58522031] [2025-03-08 15:23:26,949 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 15:23:26,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 15:23:26,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:23:26,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 15:23:26,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-08 15:23:26,952 INFO L87 Difference]: Start difference. First operand 11917 states and 18465 transitions. Second operand has 11 states, 11 states have (on average 12.272727272727273) internal successors, (135), 11 states have internal predecessors, (135), 4 states have call successors, (85), 2 states have call predecessors, (85), 4 states have return successors, (86), 4 states have call predecessors, (86), 4 states have call successors, (86) [2025-03-08 15:23:28,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:23:28,261 INFO L93 Difference]: Finished difference Result 26486 states and 40653 transitions. [2025-03-08 15:23:28,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-08 15:23:28,261 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 12.272727272727273) internal successors, (135), 11 states have internal predecessors, (135), 4 states have call successors, (85), 2 states have call predecessors, (85), 4 states have return successors, (86), 4 states have call predecessors, (86), 4 states have call successors, (86) Word has length 252 [2025-03-08 15:23:28,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:23:28,296 INFO L225 Difference]: With dead ends: 26486 [2025-03-08 15:23:28,296 INFO L226 Difference]: Without dead ends: 14658 [2025-03-08 15:23:28,309 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 528 GetRequests, 501 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=203, Invalid=553, Unknown=0, NotChecked=0, Total=756 [2025-03-08 15:23:28,310 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 1450 mSDsluCounter, 1174 mSDsCounter, 0 mSdLazyCounter, 577 mSolverCounterSat, 370 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1468 SdHoareTripleChecker+Valid, 1412 SdHoareTripleChecker+Invalid, 947 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 370 IncrementalHoareTripleChecker+Valid, 577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 15:23:28,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1468 Valid, 1412 Invalid, 947 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [370 Valid, 577 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 15:23:28,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14658 states. [2025-03-08 15:23:28,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14658 to 9634. [2025-03-08 15:23:28,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9634 states, 8804 states have (on average 1.502498864152658) internal successors, (13228), 8848 states have internal predecessors, (13228), 739 states have call successors, (739), 90 states have call predecessors, (739), 90 states have return successors, (739), 695 states have call predecessors, (739), 739 states have call successors, (739) [2025-03-08 15:23:28,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9634 states to 9634 states and 14706 transitions. [2025-03-08 15:23:28,682 INFO L78 Accepts]: Start accepts. Automaton has 9634 states and 14706 transitions. Word has length 252 [2025-03-08 15:23:28,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:23:28,684 INFO L471 AbstractCegarLoop]: Abstraction has 9634 states and 14706 transitions. [2025-03-08 15:23:28,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.272727272727273) internal successors, (135), 11 states have internal predecessors, (135), 4 states have call successors, (85), 2 states have call predecessors, (85), 4 states have return successors, (86), 4 states have call predecessors, (86), 4 states have call successors, (86) [2025-03-08 15:23:28,684 INFO L276 IsEmpty]: Start isEmpty. Operand 9634 states and 14706 transitions. [2025-03-08 15:23:28,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2025-03-08 15:23:28,693 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:23:28,693 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:23:28,701 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 15:23:28,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:23:28,894 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:23:28,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:23:28,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1631168934, now seen corresponding path program 1 times [2025-03-08 15:23:28,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:23:28,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791041908] [2025-03-08 15:23:28,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:23:28,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:23:28,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 254 statements into 1 equivalence classes. [2025-03-08 15:23:28,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 254 of 254 statements. [2025-03-08 15:23:28,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:23:28,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:23:28,973 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2025-03-08 15:23:28,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:23:28,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791041908] [2025-03-08 15:23:28,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791041908] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:23:28,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:23:28,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:23:28,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293813632] [2025-03-08 15:23:28,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:23:28,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:23:28,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:23:28,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:23:28,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:23:28,975 INFO L87 Difference]: Start difference. First operand 9634 states and 14706 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-03-08 15:23:29,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:23:29,315 INFO L93 Difference]: Finished difference Result 17178 states and 26016 transitions. [2025-03-08 15:23:29,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:23:29,316 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 254 [2025-03-08 15:23:29,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:23:29,348 INFO L225 Difference]: With dead ends: 17178 [2025-03-08 15:23:29,348 INFO L226 Difference]: Without dead ends: 11044 [2025-03-08 15:23:29,359 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-08 15:23:29,359 INFO L435 NwaCegarLoop]: 269 mSDtfsCounter, 219 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 15:23:29,359 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 496 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:23:29,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11044 states. [2025-03-08 15:23:29,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11044 to 10832. [2025-03-08 15:23:29,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10832 states, 9654 states have (on average 1.4746219183758027) internal successors, (14236), 9714 states have internal predecessors, (14236), 1043 states have call successors, (1043), 134 states have call predecessors, (1043), 134 states have return successors, (1043), 983 states have call predecessors, (1043), 1043 states have call successors, (1043) [2025-03-08 15:23:29,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10832 states to 10832 states and 16322 transitions. [2025-03-08 15:23:29,681 INFO L78 Accepts]: Start accepts. Automaton has 10832 states and 16322 transitions. Word has length 254 [2025-03-08 15:23:29,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:23:29,682 INFO L471 AbstractCegarLoop]: Abstraction has 10832 states and 16322 transitions. [2025-03-08 15:23:29,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-03-08 15:23:29,682 INFO L276 IsEmpty]: Start isEmpty. Operand 10832 states and 16322 transitions. [2025-03-08 15:23:29,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2025-03-08 15:23:29,690 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:23:29,690 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:23:29,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 15:23:29,690 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:23:29,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:23:29,691 INFO L85 PathProgramCache]: Analyzing trace with hash 866847003, now seen corresponding path program 1 times [2025-03-08 15:23:29,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:23:29,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546057118] [2025-03-08 15:23:29,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:23:29,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:23:29,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 254 statements into 1 equivalence classes. [2025-03-08 15:23:29,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 254 of 254 statements. [2025-03-08 15:23:29,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:23:29,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:23:30,190 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2025-03-08 15:23:30,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:23:30,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546057118] [2025-03-08 15:23:30,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546057118] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:23:30,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:23:30,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 15:23:30,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553807663] [2025-03-08 15:23:30,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:23:30,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 15:23:30,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:23:30,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 15:23:30,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 15:23:30,192 INFO L87 Difference]: Start difference. First operand 10832 states and 16322 transitions. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-03-08 15:23:31,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:23:31,494 INFO L93 Difference]: Finished difference Result 26243 states and 38911 transitions. [2025-03-08 15:23:31,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 15:23:31,495 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 254 [2025-03-08 15:23:31,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:23:31,557 INFO L225 Difference]: With dead ends: 26243 [2025-03-08 15:23:31,557 INFO L226 Difference]: Without dead ends: 18681 [2025-03-08 15:23:31,576 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-03-08 15:23:31,577 INFO L435 NwaCegarLoop]: 267 mSDtfsCounter, 750 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 750 SdHoareTripleChecker+Valid, 819 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 15:23:31,577 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [750 Valid, 819 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 15:23:31,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18681 states. [2025-03-08 15:23:32,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18681 to 11267. [2025-03-08 15:23:32,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11267 states, 9963 states have (on average 1.4598012646793135) internal successors, (14544), 10031 states have internal predecessors, (14544), 1151 states have call successors, (1151), 152 states have call predecessors, (1151), 152 states have return successors, (1151), 1083 states have call predecessors, (1151), 1151 states have call successors, (1151) [2025-03-08 15:23:32,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11267 states to 11267 states and 16846 transitions. [2025-03-08 15:23:32,087 INFO L78 Accepts]: Start accepts. Automaton has 11267 states and 16846 transitions. Word has length 254 [2025-03-08 15:23:32,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:23:32,088 INFO L471 AbstractCegarLoop]: Abstraction has 11267 states and 16846 transitions. [2025-03-08 15:23:32,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-03-08 15:23:32,088 INFO L276 IsEmpty]: Start isEmpty. Operand 11267 states and 16846 transitions. [2025-03-08 15:23:32,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2025-03-08 15:23:32,095 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:23:32,096 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:23:32,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 15:23:32,096 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:23:32,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:23:32,096 INFO L85 PathProgramCache]: Analyzing trace with hash 73555195, now seen corresponding path program 1 times [2025-03-08 15:23:32,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:23:32,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788572150] [2025-03-08 15:23:32,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:23:32,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:23:32,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 254 statements into 1 equivalence classes. [2025-03-08 15:23:32,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 254 of 254 statements. [2025-03-08 15:23:32,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:23:32,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:23:32,791 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 42 proven. 60 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2025-03-08 15:23:32,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:23:32,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788572150] [2025-03-08 15:23:32,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788572150] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:23:32,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [529854120] [2025-03-08 15:23:32,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:23:32,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:23:32,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:23:32,794 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-08 15:23:32,795 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-08 15:23:32,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 254 statements into 1 equivalence classes. [2025-03-08 15:23:32,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 254 of 254 statements. [2025-03-08 15:23:32,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:23:32,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:23:32,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 619 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-08 15:23:32,990 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:23:33,976 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 1204 proven. 114 refuted. 0 times theorem prover too weak. 1062 trivial. 0 not checked. [2025-03-08 15:23:33,976 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:23:35,380 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 84 proven. 117 refuted. 0 times theorem prover too weak. 2179 trivial. 0 not checked. [2025-03-08 15:23:35,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [529854120] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 15:23:35,383 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 15:23:35,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 14] total 34 [2025-03-08 15:23:35,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958817436] [2025-03-08 15:23:35,383 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 15:23:35,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-08 15:23:35,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:23:35,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-08 15:23:35,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=947, Unknown=0, NotChecked=0, Total=1122 [2025-03-08 15:23:35,385 INFO L87 Difference]: Start difference. First operand 11267 states and 16846 transitions. Second operand has 34 states, 33 states have (on average 6.393939393939394) internal successors, (211), 32 states have internal predecessors, (211), 8 states have call successors, (105), 4 states have call predecessors, (105), 8 states have return successors, (105), 8 states have call predecessors, (105), 8 states have call successors, (105) [2025-03-08 15:23:38,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:23:38,867 INFO L93 Difference]: Finished difference Result 35666 states and 52776 transitions. [2025-03-08 15:23:38,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-03-08 15:23:38,867 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 6.393939393939394) internal successors, (211), 32 states have internal predecessors, (211), 8 states have call successors, (105), 4 states have call predecessors, (105), 8 states have return successors, (105), 8 states have call predecessors, (105), 8 states have call successors, (105) Word has length 254 [2025-03-08 15:23:38,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:23:38,930 INFO L225 Difference]: With dead ends: 35666 [2025-03-08 15:23:38,930 INFO L226 Difference]: Without dead ends: 26418 [2025-03-08 15:23:38,945 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 552 GetRequests, 491 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 886 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=823, Invalid=3083, Unknown=0, NotChecked=0, Total=3906 [2025-03-08 15:23:38,946 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 2186 mSDsluCounter, 2714 mSDsCounter, 0 mSdLazyCounter, 2616 mSolverCounterSat, 406 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2187 SdHoareTripleChecker+Valid, 2876 SdHoareTripleChecker+Invalid, 3022 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 406 IncrementalHoareTripleChecker+Valid, 2616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-08 15:23:38,946 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2187 Valid, 2876 Invalid, 3022 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [406 Valid, 2616 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-08 15:23:38,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26418 states. [2025-03-08 15:23:39,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26418 to 15435. [2025-03-08 15:23:39,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15435 states, 14128 states have (on average 1.4734569648924123) internal successors, (20817), 14196 states have internal predecessors, (20817), 1151 states have call successors, (1151), 155 states have call predecessors, (1151), 155 states have return successors, (1151), 1083 states have call predecessors, (1151), 1151 states have call successors, (1151) [2025-03-08 15:23:39,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15435 states to 15435 states and 23119 transitions. [2025-03-08 15:23:39,709 INFO L78 Accepts]: Start accepts. Automaton has 15435 states and 23119 transitions. Word has length 254 [2025-03-08 15:23:39,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:23:39,710 INFO L471 AbstractCegarLoop]: Abstraction has 15435 states and 23119 transitions. [2025-03-08 15:23:39,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 6.393939393939394) internal successors, (211), 32 states have internal predecessors, (211), 8 states have call successors, (105), 4 states have call predecessors, (105), 8 states have return successors, (105), 8 states have call predecessors, (105), 8 states have call successors, (105) [2025-03-08 15:23:39,711 INFO L276 IsEmpty]: Start isEmpty. Operand 15435 states and 23119 transitions. [2025-03-08 15:23:39,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2025-03-08 15:23:39,723 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:23:39,723 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:23:39,733 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-08 15:23:39,923 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,SelfDestructingSolverStorable16 [2025-03-08 15:23:39,924 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:23:39,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:23:39,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1801231292, now seen corresponding path program 1 times [2025-03-08 15:23:39,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:23:39,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958352730] [2025-03-08 15:23:39,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:23:39,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:23:39,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 254 statements into 1 equivalence classes. [2025-03-08 15:23:40,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 254 of 254 statements. [2025-03-08 15:23:40,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:23:40,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:23:40,670 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 84 proven. 114 refuted. 0 times theorem prover too weak. 2182 trivial. 0 not checked. [2025-03-08 15:23:40,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:23:40,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958352730] [2025-03-08 15:23:40,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958352730] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:23:40,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1170586147] [2025-03-08 15:23:40,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:23:40,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:23:40,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:23:40,673 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-08 15:23:40,674 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-08 15:23:40,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 254 statements into 1 equivalence classes. [2025-03-08 15:23:40,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 254 of 254 statements. [2025-03-08 15:23:40,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:23:40,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:23:40,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 617 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-08 15:23:40,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:23:41,799 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 1204 proven. 114 refuted. 0 times theorem prover too weak. 1062 trivial. 0 not checked. [2025-03-08 15:23:41,799 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:23:42,782 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 84 proven. 117 refuted. 0 times theorem prover too weak. 2179 trivial. 0 not checked. [2025-03-08 15:23:42,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1170586147] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 15:23:42,782 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 15:23:42,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 12] total 25 [2025-03-08 15:23:42,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994513007] [2025-03-08 15:23:42,782 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 15:23:42,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-08 15:23:42,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:23:42,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-08 15:23:42,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=464, Unknown=0, NotChecked=0, Total=600 [2025-03-08 15:23:42,784 INFO L87 Difference]: Start difference. First operand 15435 states and 23119 transitions. Second operand has 25 states, 24 states have (on average 7.5) internal successors, (180), 23 states have internal predecessors, (180), 6 states have call successors, (105), 4 states have call predecessors, (105), 8 states have return successors, (105), 6 states have call predecessors, (105), 6 states have call successors, (105) [2025-03-08 15:23:56,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:23:56,203 INFO L93 Difference]: Finished difference Result 136429 states and 201783 transitions. [2025-03-08 15:23:56,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2025-03-08 15:23:56,203 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 7.5) internal successors, (180), 23 states have internal predecessors, (180), 6 states have call successors, (105), 4 states have call predecessors, (105), 8 states have return successors, (105), 6 states have call predecessors, (105), 6 states have call successors, (105) Word has length 254 [2025-03-08 15:23:56,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:23:56,480 INFO L225 Difference]: With dead ends: 136429 [2025-03-08 15:23:56,480 INFO L226 Difference]: Without dead ends: 126427 [2025-03-08 15:23:56,515 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 647 GetRequests, 517 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7130 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=4017, Invalid=13275, Unknown=0, NotChecked=0, Total=17292 [2025-03-08 15:23:56,517 INFO L435 NwaCegarLoop]: 470 mSDtfsCounter, 5087 mSDsluCounter, 3725 mSDsCounter, 0 mSdLazyCounter, 3599 mSolverCounterSat, 1488 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5116 SdHoareTripleChecker+Valid, 4195 SdHoareTripleChecker+Invalid, 5087 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1488 IncrementalHoareTripleChecker+Valid, 3599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2025-03-08 15:23:56,517 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5116 Valid, 4195 Invalid, 5087 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1488 Valid, 3599 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2025-03-08 15:23:56,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126427 states. [2025-03-08 15:24:00,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126427 to 78071. [2025-03-08 15:24:00,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78071 states, 74126 states have (on average 1.5122089415319862) internal successors, (112094), 74408 states have internal predecessors, (112094), 3419 states have call successors, (3419), 525 states have call predecessors, (3419), 525 states have return successors, (3419), 3137 states have call predecessors, (3419), 3419 states have call successors, (3419) [2025-03-08 15:24:00,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78071 states to 78071 states and 118932 transitions. [2025-03-08 15:24:00,252 INFO L78 Accepts]: Start accepts. Automaton has 78071 states and 118932 transitions. Word has length 254 [2025-03-08 15:24:00,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:24:00,252 INFO L471 AbstractCegarLoop]: Abstraction has 78071 states and 118932 transitions. [2025-03-08 15:24:00,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 7.5) internal successors, (180), 23 states have internal predecessors, (180), 6 states have call successors, (105), 4 states have call predecessors, (105), 8 states have return successors, (105), 6 states have call predecessors, (105), 6 states have call successors, (105) [2025-03-08 15:24:00,253 INFO L276 IsEmpty]: Start isEmpty. Operand 78071 states and 118932 transitions. [2025-03-08 15:24:00,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2025-03-08 15:24:00,292 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:24:00,293 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:24:00,300 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 15:24:00,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-08 15:24:00,493 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:24:00,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:24:00,495 INFO L85 PathProgramCache]: Analyzing trace with hash -2085227382, now seen corresponding path program 1 times [2025-03-08 15:24:00,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:24:00,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040951632] [2025-03-08 15:24:00,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:24:00,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:24:00,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 255 statements into 1 equivalence classes. [2025-03-08 15:24:00,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 255 of 255 statements. [2025-03-08 15:24:00,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:24:00,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:24:00,988 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2025-03-08 15:24:00,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:24:00,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040951632] [2025-03-08 15:24:00,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040951632] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:24:00,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:24:00,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 15:24:00,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628973338] [2025-03-08 15:24:00,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:24:00,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 15:24:00,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:24:00,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 15:24:00,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-03-08 15:24:00,991 INFO L87 Difference]: Start difference. First operand 78071 states and 118932 transitions. Second operand has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 2 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2025-03-08 15:24:04,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:24:04,887 INFO L93 Difference]: Finished difference Result 167197 states and 251473 transitions. [2025-03-08 15:24:04,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 15:24:04,888 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 2 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) Word has length 255 [2025-03-08 15:24:04,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:24:05,061 INFO L225 Difference]: With dead ends: 167197 [2025-03-08 15:24:05,062 INFO L226 Difference]: Without dead ends: 113083 [2025-03-08 15:24:05,129 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=137, Invalid=369, Unknown=0, NotChecked=0, Total=506 [2025-03-08 15:24:05,129 INFO L435 NwaCegarLoop]: 323 mSDtfsCounter, 1094 mSDsluCounter, 1751 mSDsCounter, 0 mSdLazyCounter, 1281 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1094 SdHoareTripleChecker+Valid, 2074 SdHoareTripleChecker+Invalid, 1441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 1281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 15:24:05,129 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1094 Valid, 2074 Invalid, 1441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 1281 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 15:24:05,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113083 states. [2025-03-08 15:24:08,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113083 to 79179. [2025-03-08 15:24:09,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79179 states, 75234 states have (on average 1.5117367147832097) internal successors, (113734), 75516 states have internal predecessors, (113734), 3419 states have call successors, (3419), 525 states have call predecessors, (3419), 525 states have return successors, (3419), 3137 states have call predecessors, (3419), 3419 states have call successors, (3419) [2025-03-08 15:24:09,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79179 states to 79179 states and 120572 transitions. [2025-03-08 15:24:09,219 INFO L78 Accepts]: Start accepts. Automaton has 79179 states and 120572 transitions. Word has length 255 [2025-03-08 15:24:09,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:24:09,220 INFO L471 AbstractCegarLoop]: Abstraction has 79179 states and 120572 transitions. [2025-03-08 15:24:09,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 2 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2025-03-08 15:24:09,220 INFO L276 IsEmpty]: Start isEmpty. Operand 79179 states and 120572 transitions. [2025-03-08 15:24:09,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2025-03-08 15:24:09,257 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:24:09,257 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:24:09,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 15:24:09,257 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:24:09,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:24:09,258 INFO L85 PathProgramCache]: Analyzing trace with hash 334953427, now seen corresponding path program 1 times [2025-03-08 15:24:09,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:24:09,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651186120] [2025-03-08 15:24:09,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:24:09,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:24:09,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 255 statements into 1 equivalence classes. [2025-03-08 15:24:09,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 255 of 255 statements. [2025-03-08 15:24:09,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:24:09,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:24:09,591 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 39 proven. 63 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2025-03-08 15:24:09,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:24:09,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651186120] [2025-03-08 15:24:09,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651186120] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:24:09,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [852988445] [2025-03-08 15:24:09,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:24:09,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:24:09,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:24:09,593 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-08 15:24:09,595 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-08 15:24:09,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 255 statements into 1 equivalence classes. [2025-03-08 15:24:09,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 255 of 255 statements. [2025-03-08 15:24:09,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:24:09,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:24:09,807 INFO L256 TraceCheckSpWp]: Trace formula consists of 619 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-08 15:24:09,811 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:24:10,158 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 1152 proven. 63 refuted. 0 times theorem prover too weak. 1165 trivial. 0 not checked. [2025-03-08 15:24:10,158 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:24:10,409 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 39 proven. 63 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2025-03-08 15:24:10,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [852988445] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 15:24:10,409 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 15:24:10,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 19 [2025-03-08 15:24:10,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735806328] [2025-03-08 15:24:10,410 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 15:24:10,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-08 15:24:10,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:24:10,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-08 15:24:10,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2025-03-08 15:24:10,411 INFO L87 Difference]: Start difference. First operand 79179 states and 120572 transitions. Second operand has 19 states, 19 states have (on average 8.263157894736842) internal successors, (157), 19 states have internal predecessors, (157), 6 states have call successors, (105), 3 states have call predecessors, (105), 6 states have return successors, (105), 6 states have call predecessors, (105), 6 states have call successors, (105) [2025-03-08 15:24:16,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:24:16,864 INFO L93 Difference]: Finished difference Result 235852 states and 359476 transitions. [2025-03-08 15:24:16,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-08 15:24:16,865 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 8.263157894736842) internal successors, (157), 19 states have internal predecessors, (157), 6 states have call successors, (105), 3 states have call predecessors, (105), 6 states have return successors, (105), 6 states have call predecessors, (105), 6 states have call successors, (105) Word has length 255 [2025-03-08 15:24:16,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:24:17,192 INFO L225 Difference]: With dead ends: 235852 [2025-03-08 15:24:17,192 INFO L226 Difference]: Without dead ends: 169835 [2025-03-08 15:24:17,261 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 532 GetRequests, 502 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=248, Invalid=744, Unknown=0, NotChecked=0, Total=992 [2025-03-08 15:24:17,261 INFO L435 NwaCegarLoop]: 430 mSDtfsCounter, 726 mSDsluCounter, 2945 mSDsCounter, 0 mSdLazyCounter, 1675 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 759 SdHoareTripleChecker+Valid, 3375 SdHoareTripleChecker+Invalid, 1784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 1675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 15:24:17,261 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [759 Valid, 3375 Invalid, 1784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 1675 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 15:24:17,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169835 states.