./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-29.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-29.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 2d1a08586e28489dc94d2285dea3402a5710056ff4819769698695dc05870e8f --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 19:45:26,426 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 19:45:26,473 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 19:45:26,482 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 19:45:26,485 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 19:45:26,506 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 19:45:26,509 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 19:45:26,509 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 19:45:26,510 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 19:45:26,510 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 19:45:26,510 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 19:45:26,511 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 19:45:26,511 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 19:45:26,511 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 19:45:26,511 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 19:45:26,511 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 19:45:26,512 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 19:45:26,512 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 19:45:26,512 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 19:45:26,512 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 19:45:26,512 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 19:45:26,512 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 19:45:26,512 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 19:45:26,512 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 19:45:26,512 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 19:45:26,512 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 19:45:26,512 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 19:45:26,512 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 19:45:26,512 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 19:45:26,513 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 19:45:26,513 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 19:45:26,513 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 19:45:26,513 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:45:26,513 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 19:45:26,513 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 19:45:26,514 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 19:45:26,514 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 19:45:26,514 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 19:45:26,514 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 19:45:26,514 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 19:45:26,514 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 19:45:26,514 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 19:45:26,514 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 19:45:26,514 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 -> 2d1a08586e28489dc94d2285dea3402a5710056ff4819769698695dc05870e8f [2025-03-03 19:45:26,757 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 19:45:26,765 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 19:45:26,767 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 19:45:26,768 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 19:45:26,768 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 19:45:26,769 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-29.i [2025-03-03 19:45:27,965 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cdc3160bb/bd80de91ecc64c4e8b144a056f08a6df/FLAGdfda67cf9 [2025-03-03 19:45:28,255 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 19:45:28,257 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-29.i [2025-03-03 19:45:28,267 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cdc3160bb/bd80de91ecc64c4e8b144a056f08a6df/FLAGdfda67cf9 [2025-03-03 19:45:28,282 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cdc3160bb/bd80de91ecc64c4e8b144a056f08a6df [2025-03-03 19:45:28,284 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 19:45:28,285 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 19:45:28,286 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 19:45:28,286 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 19:45:28,289 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 19:45:28,289 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:45:28" (1/1) ... [2025-03-03 19:45:28,290 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37de6d80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:45:28, skipping insertion in model container [2025-03-03 19:45:28,290 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:45:28" (1/1) ... [2025-03-03 19:45:28,315 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 19:45:28,406 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_fillercode_fillercodesize_ps-cn-250_file-29.i[916,929] [2025-03-03 19:45:28,497 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:45:28,513 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 19:45:28,521 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_fillercode_fillercodesize_ps-cn-250_file-29.i[916,929] [2025-03-03 19:45:28,572 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:45:28,585 INFO L204 MainTranslator]: Completed translation [2025-03-03 19:45:28,586 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:45:28 WrapperNode [2025-03-03 19:45:28,586 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 19:45:28,587 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 19:45:28,587 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 19:45:28,587 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 19:45:28,592 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:45:28" (1/1) ... [2025-03-03 19:45:28,608 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:45:28" (1/1) ... [2025-03-03 19:45:28,654 INFO L138 Inliner]: procedures = 26, calls = 89, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 550 [2025-03-03 19:45:28,654 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 19:45:28,655 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 19:45:28,655 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 19:45:28,655 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 19:45:28,661 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:45:28" (1/1) ... [2025-03-03 19:45:28,662 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:45:28" (1/1) ... [2025-03-03 19:45:28,667 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:45:28" (1/1) ... [2025-03-03 19:45:28,690 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 19:45:28,691 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:45:28" (1/1) ... [2025-03-03 19:45:28,691 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:45:28" (1/1) ... [2025-03-03 19:45:28,709 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:45:28" (1/1) ... [2025-03-03 19:45:28,713 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:45:28" (1/1) ... [2025-03-03 19:45:28,718 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:45:28" (1/1) ... [2025-03-03 19:45:28,722 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:45:28" (1/1) ... [2025-03-03 19:45:28,728 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 19:45:28,730 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 19:45:28,730 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 19:45:28,730 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 19:45:28,731 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:45:28" (1/1) ... [2025-03-03 19:45:28,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:45:28,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:45:28,757 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 19:45:28,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 19:45:28,776 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 19:45:28,777 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 19:45:28,777 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 19:45:28,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 19:45:28,777 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 19:45:28,777 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 19:45:28,873 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 19:45:28,875 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 19:45:29,545 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2025-03-03 19:45:29,546 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 19:45:29,600 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 19:45:29,600 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 19:45:29,600 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:45:29 BoogieIcfgContainer [2025-03-03 19:45:29,601 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 19:45:29,602 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 19:45:29,602 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 19:45:29,606 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 19:45:29,606 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 07:45:28" (1/3) ... [2025-03-03 19:45:29,607 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e6845ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:45:29, skipping insertion in model container [2025-03-03 19:45:29,607 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:45:28" (2/3) ... [2025-03-03 19:45:29,608 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e6845ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:45:29, skipping insertion in model container [2025-03-03 19:45:29,608 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:45:29" (3/3) ... [2025-03-03 19:45:29,609 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-29.i [2025-03-03 19:45:29,620 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 19:45:29,623 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-29.i that has 2 procedures, 228 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 19:45:29,674 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 19:45:29,684 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;@55ea63d8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 19:45:29,685 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 19:45:29,690 INFO L276 IsEmpty]: Start isEmpty. Operand has 228 states, 149 states have (on average 1.5503355704697988) internal successors, (231), 150 states have internal predecessors, (231), 76 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 76 states have call predecessors, (76), 76 states have call successors, (76) [2025-03-03 19:45:29,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2025-03-03 19:45:29,710 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:45:29,711 INFO L218 NwaCegarLoop]: trace histogram [76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:45:29,712 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:45:29,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:45:29,717 INFO L85 PathProgramCache]: Analyzing trace with hash -2137676269, now seen corresponding path program 1 times [2025-03-03 19:45:29,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:45:29,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774899755] [2025-03-03 19:45:29,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:45:29,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:45:29,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 471 statements into 1 equivalence classes. [2025-03-03 19:45:29,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 471 of 471 statements. [2025-03-03 19:45:29,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:45:29,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:45:30,157 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 0 proven. 150 refuted. 0 times theorem prover too weak. 11250 trivial. 0 not checked. [2025-03-03 19:45:30,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:45:30,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774899755] [2025-03-03 19:45:30,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774899755] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:45:30,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1997629764] [2025-03-03 19:45:30,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:45:30,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:45:30,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:45:30,161 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 19:45:30,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 19:45:30,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 471 statements into 1 equivalence classes. [2025-03-03 19:45:30,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 471 of 471 statements. [2025-03-03 19:45:30,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:45:30,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:45:30,439 INFO L256 TraceCheckSpWp]: Trace formula consists of 1047 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 19:45:30,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:45:30,501 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 11250 trivial. 0 not checked. [2025-03-03 19:45:30,502 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 19:45:30,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1997629764] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:45:30,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 19:45:30,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 19:45:30,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697426655] [2025-03-03 19:45:30,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:45:30,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 19:45:30,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:45:30,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 19:45:30,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 19:45:30,529 INFO L87 Difference]: Start difference. First operand has 228 states, 149 states have (on average 1.5503355704697988) internal successors, (231), 150 states have internal predecessors, (231), 76 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 76 states have call predecessors, (76), 76 states have call successors, (76) Second operand has 2 states, 2 states have (on average 48.0) internal successors, (96), 2 states have internal predecessors, (96), 2 states have call successors, (76), 2 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 2 states have call successors, (76) [2025-03-03 19:45:30,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:45:30,607 INFO L93 Difference]: Finished difference Result 450 states and 837 transitions. [2025-03-03 19:45:30,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 19:45:30,610 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 48.0) internal successors, (96), 2 states have internal predecessors, (96), 2 states have call successors, (76), 2 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 2 states have call successors, (76) Word has length 471 [2025-03-03 19:45:30,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:45:30,617 INFO L225 Difference]: With dead ends: 450 [2025-03-03 19:45:30,617 INFO L226 Difference]: Without dead ends: 225 [2025-03-03 19:45:30,622 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 472 GetRequests, 472 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 19:45:30,625 INFO L435 NwaCegarLoop]: 365 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:45:30,626 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 365 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:45:30,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2025-03-03 19:45:30,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 225. [2025-03-03 19:45:30,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 147 states have (on average 1.530612244897959) internal successors, (225), 147 states have internal predecessors, (225), 76 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 76 states have call predecessors, (76), 76 states have call successors, (76) [2025-03-03 19:45:30,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 377 transitions. [2025-03-03 19:45:30,692 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 377 transitions. Word has length 471 [2025-03-03 19:45:30,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:45:30,693 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 377 transitions. [2025-03-03 19:45:30,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 48.0) internal successors, (96), 2 states have internal predecessors, (96), 2 states have call successors, (76), 2 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 2 states have call successors, (76) [2025-03-03 19:45:30,694 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 377 transitions. [2025-03-03 19:45:30,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2025-03-03 19:45:30,703 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:45:30,704 INFO L218 NwaCegarLoop]: trace histogram [76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:45:30,712 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 19:45:30,904 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-03 19:45:30,905 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:45:30,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:45:30,906 INFO L85 PathProgramCache]: Analyzing trace with hash -405518471, now seen corresponding path program 1 times [2025-03-03 19:45:30,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:45:30,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987114084] [2025-03-03 19:45:30,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:45:30,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:45:30,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 471 statements into 1 equivalence classes. [2025-03-03 19:45:31,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 471 of 471 statements. [2025-03-03 19:45:31,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:45:31,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:45:31,343 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11400 trivial. 0 not checked. [2025-03-03 19:45:31,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:45:31,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987114084] [2025-03-03 19:45:31,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987114084] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:45:31,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:45:31,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 19:45:31,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501858256] [2025-03-03 19:45:31,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:45:31,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 19:45:31,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:45:31,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 19:45:31,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:45:31,348 INFO L87 Difference]: Start difference. First operand 225 states and 377 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) [2025-03-03 19:45:31,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:45:31,439 INFO L93 Difference]: Finished difference Result 579 states and 974 transitions. [2025-03-03 19:45:31,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 19:45:31,441 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) Word has length 471 [2025-03-03 19:45:31,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:45:31,447 INFO L225 Difference]: With dead ends: 579 [2025-03-03 19:45:31,448 INFO L226 Difference]: Without dead ends: 357 [2025-03-03 19:45:31,450 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:45:31,452 INFO L435 NwaCegarLoop]: 468 mSDtfsCounter, 229 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 794 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 19:45:31,452 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 794 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 19:45:31,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2025-03-03 19:45:31,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 354. [2025-03-03 19:45:31,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 245 states have (on average 1.5591836734693878) internal successors, (382), 246 states have internal predecessors, (382), 106 states have call successors, (106), 2 states have call predecessors, (106), 2 states have return successors, (106), 105 states have call predecessors, (106), 106 states have call successors, (106) [2025-03-03 19:45:31,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 594 transitions. [2025-03-03 19:45:31,503 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 594 transitions. Word has length 471 [2025-03-03 19:45:31,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:45:31,505 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 594 transitions. [2025-03-03 19:45:31,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) [2025-03-03 19:45:31,506 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 594 transitions. [2025-03-03 19:45:31,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2025-03-03 19:45:31,512 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:45:31,512 INFO L218 NwaCegarLoop]: trace histogram [76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:45:31,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 19:45:31,512 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:45:31,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:45:31,513 INFO L85 PathProgramCache]: Analyzing trace with hash -281445224, now seen corresponding path program 1 times [2025-03-03 19:45:31,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:45:31,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223810540] [2025-03-03 19:45:31,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:45:31,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:45:31,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 471 statements into 1 equivalence classes. [2025-03-03 19:45:31,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 471 of 471 statements. [2025-03-03 19:45:31,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:45:31,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:45:31,776 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11400 trivial. 0 not checked. [2025-03-03 19:45:31,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:45:31,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223810540] [2025-03-03 19:45:31,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223810540] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:45:31,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:45:31,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 19:45:31,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739028068] [2025-03-03 19:45:31,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:45:31,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 19:45:31,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:45:31,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 19:45:31,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:45:31,782 INFO L87 Difference]: Start difference. First operand 354 states and 594 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) [2025-03-03 19:45:31,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:45:31,866 INFO L93 Difference]: Finished difference Result 716 states and 1198 transitions. [2025-03-03 19:45:31,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 19:45:31,867 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) Word has length 471 [2025-03-03 19:45:31,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:45:31,870 INFO L225 Difference]: With dead ends: 716 [2025-03-03 19:45:31,871 INFO L226 Difference]: Without dead ends: 365 [2025-03-03 19:45:31,871 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:45:31,872 INFO L435 NwaCegarLoop]: 434 mSDtfsCounter, 195 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 19:45:31,872 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 784 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 19:45:31,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2025-03-03 19:45:31,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 296. [2025-03-03 19:45:31,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 217 states have (on average 1.5806451612903225) internal successors, (343), 217 states have internal predecessors, (343), 76 states have call successors, (76), 2 states have call predecessors, (76), 2 states have return successors, (76), 76 states have call predecessors, (76), 76 states have call successors, (76) [2025-03-03 19:45:31,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 495 transitions. [2025-03-03 19:45:31,890 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 495 transitions. Word has length 471 [2025-03-03 19:45:31,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:45:31,891 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 495 transitions. [2025-03-03 19:45:31,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) [2025-03-03 19:45:31,891 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 495 transitions. [2025-03-03 19:45:31,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2025-03-03 19:45:31,897 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:45:31,897 INFO L218 NwaCegarLoop]: trace histogram [76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:45:31,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 19:45:31,897 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:45:31,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:45:31,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1071864473, now seen corresponding path program 1 times [2025-03-03 19:45:31,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:45:31,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490460745] [2025-03-03 19:45:31,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:45:31,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:45:31,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 471 statements into 1 equivalence classes. [2025-03-03 19:45:31,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 471 of 471 statements. [2025-03-03 19:45:31,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:45:31,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:45:32,493 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11400 trivial. 0 not checked. [2025-03-03 19:45:32,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:45:32,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490460745] [2025-03-03 19:45:32,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490460745] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:45:32,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:45:32,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 19:45:32,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419134504] [2025-03-03 19:45:32,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:45:32,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 19:45:32,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:45:32,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 19:45:32,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-03 19:45:32,498 INFO L87 Difference]: Start difference. First operand 296 states and 495 transitions. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 2 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 2 states have call predecessors, (76), 2 states have call successors, (76) [2025-03-03 19:45:34,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:45:34,164 INFO L93 Difference]: Finished difference Result 1421 states and 2361 transitions. [2025-03-03 19:45:34,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 19:45:34,165 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 2 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 2 states have call predecessors, (76), 2 states have call successors, (76) Word has length 471 [2025-03-03 19:45:34,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:45:34,172 INFO L225 Difference]: With dead ends: 1421 [2025-03-03 19:45:34,173 INFO L226 Difference]: Without dead ends: 1128 [2025-03-03 19:45:34,174 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2025-03-03 19:45:34,174 INFO L435 NwaCegarLoop]: 460 mSDtfsCounter, 1622 mSDsluCounter, 1504 mSDsCounter, 0 mSdLazyCounter, 1343 mSolverCounterSat, 658 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1622 SdHoareTripleChecker+Valid, 1964 SdHoareTripleChecker+Invalid, 2001 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 658 IncrementalHoareTripleChecker+Valid, 1343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-03 19:45:34,175 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1622 Valid, 1964 Invalid, 2001 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [658 Valid, 1343 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-03 19:45:34,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1128 states. [2025-03-03 19:45:34,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1128 to 982. [2025-03-03 19:45:34,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 982 states, 725 states have (on average 1.56) internal successors, (1131), 727 states have internal predecessors, (1131), 247 states have call successors, (247), 9 states have call predecessors, (247), 9 states have return successors, (247), 245 states have call predecessors, (247), 247 states have call successors, (247) [2025-03-03 19:45:34,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 1625 transitions. [2025-03-03 19:45:34,272 INFO L78 Accepts]: Start accepts. Automaton has 982 states and 1625 transitions. Word has length 471 [2025-03-03 19:45:34,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:45:34,273 INFO L471 AbstractCegarLoop]: Abstraction has 982 states and 1625 transitions. [2025-03-03 19:45:34,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 2 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 2 states have call predecessors, (76), 2 states have call successors, (76) [2025-03-03 19:45:34,274 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 1625 transitions. [2025-03-03 19:45:34,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2025-03-03 19:45:34,285 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:45:34,286 INFO L218 NwaCegarLoop]: trace histogram [76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:45:34,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 19:45:34,287 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:45:34,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:45:34,288 INFO L85 PathProgramCache]: Analyzing trace with hash 227392602, now seen corresponding path program 1 times [2025-03-03 19:45:34,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:45:34,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146409715] [2025-03-03 19:45:34,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:45:34,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:45:34,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 471 statements into 1 equivalence classes. [2025-03-03 19:45:34,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 471 of 471 statements. [2025-03-03 19:45:34,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:45:34,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:45:34,684 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11400 trivial. 0 not checked. [2025-03-03 19:45:34,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:45:34,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146409715] [2025-03-03 19:45:34,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146409715] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:45:34,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:45:34,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 19:45:34,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988652356] [2025-03-03 19:45:34,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:45:34,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 19:45:34,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:45:34,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 19:45:34,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:45:34,690 INFO L87 Difference]: Start difference. First operand 982 states and 1625 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) [2025-03-03 19:45:34,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:45:34,785 INFO L93 Difference]: Finished difference Result 2940 states and 4869 transitions. [2025-03-03 19:45:34,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 19:45:34,786 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) Word has length 471 [2025-03-03 19:45:34,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:45:34,797 INFO L225 Difference]: With dead ends: 2940 [2025-03-03 19:45:34,797 INFO L226 Difference]: Without dead ends: 1961 [2025-03-03 19:45:34,800 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-03 19:45:34,801 INFO L435 NwaCegarLoop]: 363 mSDtfsCounter, 214 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 721 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:45:34,801 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 721 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:45:34,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1961 states. [2025-03-03 19:45:34,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1961 to 1959. [2025-03-03 19:45:34,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1959 states, 1446 states have (on average 1.5587828492392808) internal successors, (2254), 1450 states have internal predecessors, (2254), 494 states have call successors, (494), 18 states have call predecessors, (494), 18 states have return successors, (494), 490 states have call predecessors, (494), 494 states have call successors, (494) [2025-03-03 19:45:34,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1959 states to 1959 states and 3242 transitions. [2025-03-03 19:45:34,907 INFO L78 Accepts]: Start accepts. Automaton has 1959 states and 3242 transitions. Word has length 471 [2025-03-03 19:45:34,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:45:34,908 INFO L471 AbstractCegarLoop]: Abstraction has 1959 states and 3242 transitions. [2025-03-03 19:45:34,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) [2025-03-03 19:45:34,909 INFO L276 IsEmpty]: Start isEmpty. Operand 1959 states and 3242 transitions. [2025-03-03 19:45:34,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2025-03-03 19:45:34,915 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:45:34,915 INFO L218 NwaCegarLoop]: trace histogram [76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:45:34,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 19:45:34,915 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:45:34,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:45:34,917 INFO L85 PathProgramCache]: Analyzing trace with hash 256021753, now seen corresponding path program 1 times [2025-03-03 19:45:34,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:45:34,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756783921] [2025-03-03 19:45:34,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:45:34,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:45:34,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 471 statements into 1 equivalence classes. [2025-03-03 19:45:34,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 471 of 471 statements. [2025-03-03 19:45:34,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:45:34,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:45:35,324 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11400 trivial. 0 not checked. [2025-03-03 19:45:35,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:45:35,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756783921] [2025-03-03 19:45:35,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756783921] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:45:35,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:45:35,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 19:45:35,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845830540] [2025-03-03 19:45:35,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:45:35,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 19:45:35,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:45:35,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 19:45:35,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 19:45:35,326 INFO L87 Difference]: Start difference. First operand 1959 states and 3242 transitions. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) [2025-03-03 19:45:36,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:45:36,465 INFO L93 Difference]: Finished difference Result 7551 states and 12413 transitions. [2025-03-03 19:45:36,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 19:45:36,466 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) Word has length 471 [2025-03-03 19:45:36,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:45:36,495 INFO L225 Difference]: With dead ends: 7551 [2025-03-03 19:45:36,496 INFO L226 Difference]: Without dead ends: 5595 [2025-03-03 19:45:36,503 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-03 19:45:36,505 INFO L435 NwaCegarLoop]: 473 mSDtfsCounter, 941 mSDsluCounter, 1485 mSDsCounter, 0 mSdLazyCounter, 667 mSolverCounterSat, 402 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 941 SdHoareTripleChecker+Valid, 1958 SdHoareTripleChecker+Invalid, 1069 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 402 IncrementalHoareTripleChecker+Valid, 667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 19:45:36,505 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [941 Valid, 1958 Invalid, 1069 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [402 Valid, 667 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 19:45:36,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5595 states. [2025-03-03 19:45:36,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5595 to 5199. [2025-03-03 19:45:36,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5199 states, 3986 states have (on average 1.5689914701455092) internal successors, (6254), 4006 states have internal predecessors, (6254), 1150 states have call successors, (1150), 62 states have call predecessors, (1150), 62 states have return successors, (1150), 1130 states have call predecessors, (1150), 1150 states have call successors, (1150) [2025-03-03 19:45:36,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5199 states to 5199 states and 8554 transitions. [2025-03-03 19:45:36,801 INFO L78 Accepts]: Start accepts. Automaton has 5199 states and 8554 transitions. Word has length 471 [2025-03-03 19:45:36,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:45:36,802 INFO L471 AbstractCegarLoop]: Abstraction has 5199 states and 8554 transitions. [2025-03-03 19:45:36,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) [2025-03-03 19:45:36,802 INFO L276 IsEmpty]: Start isEmpty. Operand 5199 states and 8554 transitions. [2025-03-03 19:45:36,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2025-03-03 19:45:36,807 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:45:36,807 INFO L218 NwaCegarLoop]: trace histogram [76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:45:36,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 19:45:36,807 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:45:36,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:45:36,808 INFO L85 PathProgramCache]: Analyzing trace with hash -937562665, now seen corresponding path program 1 times [2025-03-03 19:45:36,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:45:36,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375618533] [2025-03-03 19:45:36,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:45:36,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:45:36,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 471 statements into 1 equivalence classes. [2025-03-03 19:45:36,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 471 of 471 statements. [2025-03-03 19:45:36,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:45:36,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:45:37,120 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11400 trivial. 0 not checked. [2025-03-03 19:45:37,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:45:37,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375618533] [2025-03-03 19:45:37,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375618533] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:45:37,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:45:37,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 19:45:37,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235353244] [2025-03-03 19:45:37,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:45:37,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 19:45:37,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:45:37,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 19:45:37,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 19:45:37,123 INFO L87 Difference]: Start difference. First operand 5199 states and 8554 transitions. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 2 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 2 states have call predecessors, (76), 2 states have call successors, (76) [2025-03-03 19:45:38,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:45:38,538 INFO L93 Difference]: Finished difference Result 13574 states and 22261 transitions. [2025-03-03 19:45:38,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 19:45:38,539 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 2 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 2 states have call predecessors, (76), 2 states have call successors, (76) Word has length 471 [2025-03-03 19:45:38,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:45:38,577 INFO L225 Difference]: With dead ends: 13574 [2025-03-03 19:45:38,577 INFO L226 Difference]: Without dead ends: 8378 [2025-03-03 19:45:38,588 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-03 19:45:38,589 INFO L435 NwaCegarLoop]: 565 mSDtfsCounter, 1267 mSDsluCounter, 865 mSDsCounter, 0 mSdLazyCounter, 611 mSolverCounterSat, 579 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1267 SdHoareTripleChecker+Valid, 1430 SdHoareTripleChecker+Invalid, 1190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 579 IncrementalHoareTripleChecker+Valid, 611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:45:38,589 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1267 Valid, 1430 Invalid, 1190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [579 Valid, 611 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 19:45:38,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8378 states. [2025-03-03 19:45:38,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8378 to 8297. [2025-03-03 19:45:38,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8297 states, 6224 states have (on average 1.544987146529563) internal successors, (9616), 6259 states have internal predecessors, (9616), 1962 states have call successors, (1962), 110 states have call predecessors, (1962), 110 states have return successors, (1962), 1927 states have call predecessors, (1962), 1962 states have call successors, (1962) [2025-03-03 19:45:39,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8297 states to 8297 states and 13540 transitions. [2025-03-03 19:45:39,021 INFO L78 Accepts]: Start accepts. Automaton has 8297 states and 13540 transitions. Word has length 471 [2025-03-03 19:45:39,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:45:39,022 INFO L471 AbstractCegarLoop]: Abstraction has 8297 states and 13540 transitions. [2025-03-03 19:45:39,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 2 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 2 states have call predecessors, (76), 2 states have call successors, (76) [2025-03-03 19:45:39,023 INFO L276 IsEmpty]: Start isEmpty. Operand 8297 states and 13540 transitions. [2025-03-03 19:45:39,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2025-03-03 19:45:39,028 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:45:39,029 INFO L218 NwaCegarLoop]: trace histogram [76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:45:39,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 19:45:39,029 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:45:39,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:45:39,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1782034536, now seen corresponding path program 1 times [2025-03-03 19:45:39,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:45:39,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646603103] [2025-03-03 19:45:39,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:45:39,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:45:39,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 471 statements into 1 equivalence classes. [2025-03-03 19:45:39,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 471 of 471 statements. [2025-03-03 19:45:39,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:45:39,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:45:39,402 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11400 trivial. 0 not checked. [2025-03-03 19:45:39,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:45:39,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646603103] [2025-03-03 19:45:39,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646603103] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:45:39,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:45:39,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 19:45:39,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688381786] [2025-03-03 19:45:39,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:45:39,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 19:45:39,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:45:39,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 19:45:39,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:45:39,404 INFO L87 Difference]: Start difference. First operand 8297 states and 13540 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) [2025-03-03 19:45:39,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:45:39,811 INFO L93 Difference]: Finished difference Result 16573 states and 27081 transitions. [2025-03-03 19:45:39,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 19:45:39,812 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) Word has length 471 [2025-03-03 19:45:39,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:45:39,858 INFO L225 Difference]: With dead ends: 16573 [2025-03-03 19:45:39,859 INFO L226 Difference]: Without dead ends: 8369 [2025-03-03 19:45:39,875 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-03 19:45:39,875 INFO L435 NwaCegarLoop]: 364 mSDtfsCounter, 0 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 723 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:45:39,876 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 723 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:45:39,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8369 states. [2025-03-03 19:45:40,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8369 to 8369. [2025-03-03 19:45:40,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8369 states, 6296 states have (on average 1.5387547649301143) internal successors, (9688), 6331 states have internal predecessors, (9688), 1962 states have call successors, (1962), 110 states have call predecessors, (1962), 110 states have return successors, (1962), 1927 states have call predecessors, (1962), 1962 states have call successors, (1962) [2025-03-03 19:45:40,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8369 states to 8369 states and 13612 transitions. [2025-03-03 19:45:40,334 INFO L78 Accepts]: Start accepts. Automaton has 8369 states and 13612 transitions. Word has length 471 [2025-03-03 19:45:40,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:45:40,336 INFO L471 AbstractCegarLoop]: Abstraction has 8369 states and 13612 transitions. [2025-03-03 19:45:40,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) [2025-03-03 19:45:40,337 INFO L276 IsEmpty]: Start isEmpty. Operand 8369 states and 13612 transitions. [2025-03-03 19:45:40,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2025-03-03 19:45:40,342 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:45:40,342 INFO L218 NwaCegarLoop]: trace histogram [76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:45:40,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 19:45:40,342 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:45:40,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:45:40,344 INFO L85 PathProgramCache]: Analyzing trace with hash 435723417, now seen corresponding path program 1 times [2025-03-03 19:45:40,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:45:40,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364624087] [2025-03-03 19:45:40,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:45:40,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:45:40,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 471 statements into 1 equivalence classes. [2025-03-03 19:45:40,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 471 of 471 statements. [2025-03-03 19:45:40,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:45:40,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:45:40,637 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11400 trivial. 0 not checked. [2025-03-03 19:45:40,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:45:40,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364624087] [2025-03-03 19:45:40,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364624087] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:45:40,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:45:40,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 19:45:40,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130486784] [2025-03-03 19:45:40,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:45:40,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 19:45:40,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:45:40,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 19:45:40,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 19:45:40,640 INFO L87 Difference]: Start difference. First operand 8369 states and 13612 transitions. Second operand has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) [2025-03-03 19:45:41,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:45:41,605 INFO L93 Difference]: Finished difference Result 26651 states and 43345 transitions. [2025-03-03 19:45:41,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 19:45:41,606 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) Word has length 471 [2025-03-03 19:45:41,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:45:41,685 INFO L225 Difference]: With dead ends: 26651 [2025-03-03 19:45:41,685 INFO L226 Difference]: Without dead ends: 18375 [2025-03-03 19:45:41,718 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 19:45:41,719 INFO L435 NwaCegarLoop]: 607 mSDtfsCounter, 605 mSDsluCounter, 702 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 605 SdHoareTripleChecker+Valid, 1309 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 19:45:41,719 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [605 Valid, 1309 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 19:45:41,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18375 states. [2025-03-03 19:45:42,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18375 to 16579. [2025-03-03 19:45:42,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16579 states, 12484 states have (on average 1.525472604934316) internal successors, (19044), 12553 states have internal predecessors, (19044), 3872 states have call successors, (3872), 222 states have call predecessors, (3872), 222 states have return successors, (3872), 3803 states have call predecessors, (3872), 3872 states have call successors, (3872) [2025-03-03 19:45:42,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16579 states to 16579 states and 26788 transitions. [2025-03-03 19:45:42,822 INFO L78 Accepts]: Start accepts. Automaton has 16579 states and 26788 transitions. Word has length 471 [2025-03-03 19:45:42,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:45:42,823 INFO L471 AbstractCegarLoop]: Abstraction has 16579 states and 26788 transitions. [2025-03-03 19:45:42,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) [2025-03-03 19:45:42,823 INFO L276 IsEmpty]: Start isEmpty. Operand 16579 states and 26788 transitions. [2025-03-03 19:45:42,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2025-03-03 19:45:42,829 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:45:42,829 INFO L218 NwaCegarLoop]: trace histogram [76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:45:42,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 19:45:42,830 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:45:42,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:45:42,830 INFO L85 PathProgramCache]: Analyzing trace with hash 647074330, now seen corresponding path program 1 times [2025-03-03 19:45:42,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:45:42,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047416662] [2025-03-03 19:45:42,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:45:42,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:45:42,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 471 statements into 1 equivalence classes. [2025-03-03 19:45:42,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 471 of 471 statements. [2025-03-03 19:45:42,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:45:42,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:45:44,307 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11400 trivial. 0 not checked. [2025-03-03 19:45:44,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:45:44,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047416662] [2025-03-03 19:45:44,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047416662] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:45:44,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:45:44,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 19:45:44,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573068671] [2025-03-03 19:45:44,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:45:44,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 19:45:44,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:45:44,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 19:45:44,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-03 19:45:44,309 INFO L87 Difference]: Start difference. First operand 16579 states and 26788 transitions. Second operand has 11 states, 11 states have (on average 8.545454545454545) internal successors, (94), 11 states have internal predecessors, (94), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) [2025-03-03 19:46:00,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:46:00,212 INFO L93 Difference]: Finished difference Result 93211 states and 148981 transitions. [2025-03-03 19:46:00,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-03 19:46:00,213 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.545454545454545) internal successors, (94), 11 states have internal predecessors, (94), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) Word has length 471 [2025-03-03 19:46:00,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:46:00,542 INFO L225 Difference]: With dead ends: 93211 [2025-03-03 19:46:00,542 INFO L226 Difference]: Without dead ends: 76245 [2025-03-03 19:46:00,607 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=265, Invalid=665, Unknown=0, NotChecked=0, Total=930 [2025-03-03 19:46:00,607 INFO L435 NwaCegarLoop]: 697 mSDtfsCounter, 5527 mSDsluCounter, 2975 mSDsCounter, 0 mSdLazyCounter, 3748 mSolverCounterSat, 3720 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5527 SdHoareTripleChecker+Valid, 3672 SdHoareTripleChecker+Invalid, 7468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3720 IncrementalHoareTripleChecker+Valid, 3748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.9s IncrementalHoareTripleChecker+Time [2025-03-03 19:46:00,608 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5527 Valid, 3672 Invalid, 7468 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3720 Valid, 3748 Invalid, 0 Unknown, 0 Unchecked, 7.9s Time] [2025-03-03 19:46:00,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76245 states. [2025-03-03 19:46:03,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76245 to 37801. [2025-03-03 19:46:03,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37801 states, 28280 states have (on average 1.520862800565771) internal successors, (43010), 28449 states have internal predecessors, (43010), 9004 states have call successors, (9004), 516 states have call predecessors, (9004), 516 states have return successors, (9004), 8835 states have call predecessors, (9004), 9004 states have call successors, (9004) [2025-03-03 19:46:03,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37801 states to 37801 states and 61018 transitions. [2025-03-03 19:46:03,903 INFO L78 Accepts]: Start accepts. Automaton has 37801 states and 61018 transitions. Word has length 471 [2025-03-03 19:46:03,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:46:03,904 INFO L471 AbstractCegarLoop]: Abstraction has 37801 states and 61018 transitions. [2025-03-03 19:46:03,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.545454545454545) internal successors, (94), 11 states have internal predecessors, (94), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) [2025-03-03 19:46:03,904 INFO L276 IsEmpty]: Start isEmpty. Operand 37801 states and 61018 transitions. [2025-03-03 19:46:03,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2025-03-03 19:46:03,915 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:46:03,915 INFO L218 NwaCegarLoop]: trace histogram [76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:46:03,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 19:46:03,915 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:46:03,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:46:03,916 INFO L85 PathProgramCache]: Analyzing trace with hash -648222660, now seen corresponding path program 1 times [2025-03-03 19:46:03,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:46:03,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999676434] [2025-03-03 19:46:03,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:46:03,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:46:03,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 471 statements into 1 equivalence classes. [2025-03-03 19:46:04,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 471 of 471 statements. [2025-03-03 19:46:04,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:46:04,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:46:04,305 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 69 proven. 156 refuted. 0 times theorem prover too weak. 11175 trivial. 0 not checked. [2025-03-03 19:46:04,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:46:04,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999676434] [2025-03-03 19:46:04,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999676434] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:46:04,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1010018844] [2025-03-03 19:46:04,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:46:04,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:46:04,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:46:04,309 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 19:46:04,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 19:46:04,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 471 statements into 1 equivalence classes. [2025-03-03 19:46:04,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 471 of 471 statements. [2025-03-03 19:46:04,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:46:04,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:46:04,486 INFO L256 TraceCheckSpWp]: Trace formula consists of 1040 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-03 19:46:04,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:46:05,142 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 6693 proven. 102 refuted. 0 times theorem prover too weak. 4605 trivial. 0 not checked. [2025-03-03 19:46:05,142 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 19:46:05,728 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 123 proven. 102 refuted. 0 times theorem prover too weak. 11175 trivial. 0 not checked. [2025-03-03 19:46:05,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1010018844] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 19:46:05,728 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 19:46:05,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 10] total 21 [2025-03-03 19:46:05,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452136867] [2025-03-03 19:46:05,729 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 19:46:05,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-03 19:46:05,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:46:05,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-03 19:46:05,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2025-03-03 19:46:05,732 INFO L87 Difference]: Start difference. First operand 37801 states and 61018 transitions. Second operand has 21 states, 20 states have (on average 11.05) internal successors, (221), 21 states have internal predecessors, (221), 8 states have call successors, (178), 3 states have call predecessors, (178), 5 states have return successors, (179), 7 states have call predecessors, (179), 8 states have call successors, (179) [2025-03-03 19:46:24,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:46:24,452 INFO L93 Difference]: Finished difference Result 184890 states and 289337 transitions. [2025-03-03 19:46:24,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2025-03-03 19:46:24,453 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 11.05) internal successors, (221), 21 states have internal predecessors, (221), 8 states have call successors, (178), 3 states have call predecessors, (178), 5 states have return successors, (179), 7 states have call predecessors, (179), 8 states have call successors, (179) Word has length 471 [2025-03-03 19:46:24,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:46:25,019 INFO L225 Difference]: With dead ends: 184890 [2025-03-03 19:46:25,020 INFO L226 Difference]: Without dead ends: 146902 [2025-03-03 19:46:25,145 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1090 GetRequests, 941 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9024 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=4021, Invalid=18629, Unknown=0, NotChecked=0, Total=22650 [2025-03-03 19:46:25,146 INFO L435 NwaCegarLoop]: 361 mSDtfsCounter, 5950 mSDsluCounter, 2240 mSDsCounter, 0 mSdLazyCounter, 4003 mSolverCounterSat, 3728 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5950 SdHoareTripleChecker+Valid, 2601 SdHoareTripleChecker+Invalid, 7731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3728 IncrementalHoareTripleChecker+Valid, 4003 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2025-03-03 19:46:25,146 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5950 Valid, 2601 Invalid, 7731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3728 Valid, 4003 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2025-03-03 19:46:25,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146902 states. [2025-03-03 19:46:32,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146902 to 80145. [2025-03-03 19:46:32,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80145 states, 63881 states have (on average 1.5377968410012366) internal successors, (98236), 64148 states have internal predecessors, (98236), 14894 states have call successors, (14894), 1369 states have call predecessors, (14894), 1369 states have return successors, (14894), 14627 states have call predecessors, (14894), 14894 states have call successors, (14894) [2025-03-03 19:46:32,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80145 states to 80145 states and 128024 transitions. [2025-03-03 19:46:32,983 INFO L78 Accepts]: Start accepts. Automaton has 80145 states and 128024 transitions. Word has length 471 [2025-03-03 19:46:32,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:46:32,985 INFO L471 AbstractCegarLoop]: Abstraction has 80145 states and 128024 transitions. [2025-03-03 19:46:32,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 11.05) internal successors, (221), 21 states have internal predecessors, (221), 8 states have call successors, (178), 3 states have call predecessors, (178), 5 states have return successors, (179), 7 states have call predecessors, (179), 8 states have call successors, (179) [2025-03-03 19:46:32,985 INFO L276 IsEmpty]: Start isEmpty. Operand 80145 states and 128024 transitions. [2025-03-03 19:46:33,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 473 [2025-03-03 19:46:33,001 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:46:33,002 INFO L218 NwaCegarLoop]: trace histogram [76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:46:33,010 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 19:46:33,202 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,SelfDestructingSolverStorable10 [2025-03-03 19:46:33,203 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:46:33,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:46:33,204 INFO L85 PathProgramCache]: Analyzing trace with hash -159724448, now seen corresponding path program 1 times [2025-03-03 19:46:33,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:46:33,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723589756] [2025-03-03 19:46:33,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:46:33,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:46:33,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 472 statements into 1 equivalence classes. [2025-03-03 19:46:33,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 472 of 472 statements. [2025-03-03 19:46:33,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:46:33,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:46:33,655 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 123 proven. 102 refuted. 0 times theorem prover too weak. 11175 trivial. 0 not checked. [2025-03-03 19:46:33,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:46:33,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723589756] [2025-03-03 19:46:33,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723589756] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:46:33,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1401863273] [2025-03-03 19:46:33,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:46:33,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:46:33,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:46:33,658 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 19:46:33,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 19:46:33,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 472 statements into 1 equivalence classes. [2025-03-03 19:46:33,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 472 of 472 statements. [2025-03-03 19:46:33,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:46:33,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:46:33,848 INFO L256 TraceCheckSpWp]: Trace formula consists of 1036 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-03 19:46:33,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:46:34,533 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 6021 proven. 192 refuted. 0 times theorem prover too weak. 5187 trivial. 0 not checked. [2025-03-03 19:46:34,533 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 19:46:34,996 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 252 proven. 195 refuted. 0 times theorem prover too weak. 10953 trivial. 0 not checked. [2025-03-03 19:46:34,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1401863273] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 19:46:34,997 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 19:46:34,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 10] total 21 [2025-03-03 19:46:34,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595383895] [2025-03-03 19:46:34,997 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 19:46:34,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-03 19:46:34,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:46:34,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-03 19:46:34,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=334, Unknown=0, NotChecked=0, Total=420 [2025-03-03 19:46:34,999 INFO L87 Difference]: Start difference. First operand 80145 states and 128024 transitions. Second operand has 21 states, 21 states have (on average 9.333333333333334) internal successors, (196), 21 states have internal predecessors, (196), 7 states have call successors, (186), 3 states have call predecessors, (186), 7 states have return successors, (187), 7 states have call predecessors, (187), 7 states have call successors, (187) [2025-03-03 19:46:41,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:46:41,387 INFO L93 Difference]: Finished difference Result 136643 states and 216819 transitions. [2025-03-03 19:46:41,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-03-03 19:46:41,387 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 9.333333333333334) internal successors, (196), 21 states have internal predecessors, (196), 7 states have call successors, (186), 3 states have call predecessors, (186), 7 states have return successors, (187), 7 states have call predecessors, (187), 7 states have call successors, (187) Word has length 472 [2025-03-03 19:46:41,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:46:41,662 INFO L225 Difference]: With dead ends: 136643 [2025-03-03 19:46:41,662 INFO L226 Difference]: Without dead ends: 66323 [2025-03-03 19:46:41,826 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 990 GetRequests, 936 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 724 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=644, Invalid=2436, Unknown=0, NotChecked=0, Total=3080 [2025-03-03 19:46:41,827 INFO L435 NwaCegarLoop]: 641 mSDtfsCounter, 3521 mSDsluCounter, 3379 mSDsCounter, 0 mSdLazyCounter, 4025 mSolverCounterSat, 1608 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3564 SdHoareTripleChecker+Valid, 4020 SdHoareTripleChecker+Invalid, 5633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1608 IncrementalHoareTripleChecker+Valid, 4025 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-03 19:46:41,827 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3564 Valid, 4020 Invalid, 5633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1608 Valid, 4025 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-03 19:46:41,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66323 states. [2025-03-03 19:46:44,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66323 to 52111. [2025-03-03 19:46:44,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52111 states, 42354 states have (on average 1.5501251357604948) internal successors, (65654), 42479 states have internal predecessors, (65654), 8909 states have call successors, (8909), 847 states have call predecessors, (8909), 847 states have return successors, (8909), 8784 states have call predecessors, (8909), 8909 states have call successors, (8909) [2025-03-03 19:46:44,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52111 states to 52111 states and 83472 transitions. [2025-03-03 19:46:44,903 INFO L78 Accepts]: Start accepts. Automaton has 52111 states and 83472 transitions. Word has length 472 [2025-03-03 19:46:44,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:46:44,904 INFO L471 AbstractCegarLoop]: Abstraction has 52111 states and 83472 transitions. [2025-03-03 19:46:44,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 9.333333333333334) internal successors, (196), 21 states have internal predecessors, (196), 7 states have call successors, (186), 3 states have call predecessors, (186), 7 states have return successors, (187), 7 states have call predecessors, (187), 7 states have call successors, (187) [2025-03-03 19:46:44,904 INFO L276 IsEmpty]: Start isEmpty. Operand 52111 states and 83472 transitions. [2025-03-03 19:46:44,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 473 [2025-03-03 19:46:44,913 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:46:44,913 INFO L218 NwaCegarLoop]: trace histogram [76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:46:44,922 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 19:46:45,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:46:45,115 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:46:45,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:46:45,116 INFO L85 PathProgramCache]: Analyzing trace with hash 785907903, now seen corresponding path program 1 times [2025-03-03 19:46:45,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:46:45,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257239208] [2025-03-03 19:46:45,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:46:45,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:46:45,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 472 statements into 1 equivalence classes. [2025-03-03 19:46:45,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 472 of 472 statements. [2025-03-03 19:46:45,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:46:45,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:46:45,402 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11400 trivial. 0 not checked. [2025-03-03 19:46:45,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:46:45,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257239208] [2025-03-03 19:46:45,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257239208] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:46:45,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:46:45,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 19:46:45,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725846599] [2025-03-03 19:46:45,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:46:45,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 19:46:45,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:46:45,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 19:46:45,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 19:46:45,404 INFO L87 Difference]: Start difference. First operand 52111 states and 83472 transitions. Second operand has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76)